./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test25_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_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/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 ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 04:07:37,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:07:37,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:07:37,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:07:37,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:07:37,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:07:37,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:07:37,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:07:37,014 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:07:37,015 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:07:37,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:07:37,016 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:07:37,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:07:37,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:07:37,017 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:07:37,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:07:37,018 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:07:37,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:07:37,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:07:37,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:07:37,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:07:37,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:07:37,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:07:37,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:07:37,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:07:37,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:07:37,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:07:37,025 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:07:37,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:07:37,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:07:37,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:07:37,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:07:37,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:07:37,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:07:37,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:07:37,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:07:37,028 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 04:07:37,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:07:37,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:07:37,039 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:07:37,039 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:07:37,039 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:07:37,039 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:07:37,039 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:07:37,039 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:07:37,040 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:07:37,040 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:07:37,040 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:07:37,040 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:07:37,040 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:07:37,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:07:37,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:07:37,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:07:37,041 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:07:37,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:07:37,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:07:37,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:07:37,042 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:07:37,042 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:07:37,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:07:37,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:07:37,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:07:37,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:07:37,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:07:37,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:07:37,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:07:37,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:07:37,043 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:07:37,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:07:37,044 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:07:37,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:07:37,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:07:37,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 04:07:37,044 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_48e8b2a2-acec-49d1-b3fa-412a3ccec815/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 -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-12-09 04:07:37,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:07:37,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:07:37,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:07:37,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:07:37,081 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:07:37,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-12-09 04:07:37,122 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/data/a453a3989/1473fe027d22452bbfaeb97f73169d87/FLAG69ebc3685 [2018-12-09 04:07:37,530 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:07:37,530 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-12-09 04:07:37,534 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/data/a453a3989/1473fe027d22452bbfaeb97f73169d87/FLAG69ebc3685 [2018-12-09 04:07:37,542 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/data/a453a3989/1473fe027d22452bbfaeb97f73169d87 [2018-12-09 04:07:37,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:07:37,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:07:37,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:07:37,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:07:37,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:07:37,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4465efb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37, skipping insertion in model container [2018-12-09 04:07:37,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:07:37,564 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:07:37,655 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:07:37,660 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:07:37,671 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:07:37,680 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:07:37,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37 WrapperNode [2018-12-09 04:07:37,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:07:37,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:07:37,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:07:37,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:07:37,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:07:37,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:07:37,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:07:37,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:07:37,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... [2018-12-09 04:07:37,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:07:37,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:07:37,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:07:37,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:07:37,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:07:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 04:07:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:07:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 04:07:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-09 04:07:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-09 04:07:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 04:07:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:07:37,887 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:07:37,887 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 04:07:37,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:07:37 BoogieIcfgContainer [2018-12-09 04:07:37,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:07:37,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:07:37,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:07:37,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:07:37,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:07:37" (1/3) ... [2018-12-09 04:07:37,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:07:37, skipping insertion in model container [2018-12-09 04:07:37,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:37" (2/3) ... [2018-12-09 04:07:37,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:07:37, skipping insertion in model container [2018-12-09 04:07:37,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:07:37" (3/3) ... [2018-12-09 04:07:37,892 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-12-09 04:07:37,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:07:37,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 04:07:37,912 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 04:07:37,929 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:07:37,929 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:07:37,929 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:07:37,929 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:07:37,929 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:07:37,929 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:07:37,929 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:07:37,929 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:07:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-09 04:07:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 04:07:37,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:37,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:37,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:37,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-12-09 04:07:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:37,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:37,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:37,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:37,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:38,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:38,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:07:38,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:38,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 04:07:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 04:07:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 04:07:38,041 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-12-09 04:07:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:38,052 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-12-09 04:07:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 04:07:38,053 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-12-09 04:07:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:38,058 INFO L225 Difference]: With dead ends: 42 [2018-12-09 04:07:38,058 INFO L226 Difference]: Without dead ends: 20 [2018-12-09 04:07:38,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 04:07:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-09 04:07:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 04:07:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 04:07:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-09 04:07:38,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-12-09 04:07:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:38,080 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-09 04:07:38,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 04:07:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-09 04:07:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 04:07:38,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:38,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:38,081 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:38,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-12-09 04:07:38,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:38,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:07:38,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:38,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:07:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:07:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:38,117 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-12-09 04:07:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:38,131 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-09 04:07:38,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:07:38,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 04:07:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:38,132 INFO L225 Difference]: With dead ends: 34 [2018-12-09 04:07:38,132 INFO L226 Difference]: Without dead ends: 22 [2018-12-09 04:07:38,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-09 04:07:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-09 04:07:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 04:07:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 04:07:38,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-09 04:07:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:38,135 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 04:07:38,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:07:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 04:07:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 04:07:38,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:38,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:38,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:38,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-12-09 04:07:38,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:38,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:38,181 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-09 04:07:38,182 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [21], [24], [29], [32], [39], [42], [52], [55], [56], [57], [58], [59], [61], [62] [2018-12-09 04:07:38,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:07:38,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:07:38,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:07:38,343 INFO L272 AbstractInterpreter]: Visited 20 different actions 43 times. Merged at 11 different actions 17 times. Widened at 1 different actions 1 times. Performed 428 root evaluator evaluations with a maximum evaluation depth of 5. Performed 428 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-12-09 04:07:38,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:38,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:07:38,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:38,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:38,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:07:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:38,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:38,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:38,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-09 04:07:38,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:38,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:07:38,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:07:38,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:07:38,436 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-12-09 04:07:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:38,455 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-09 04:07:38,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:07:38,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 04:07:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:38,456 INFO L225 Difference]: With dead ends: 36 [2018-12-09 04:07:38,456 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 04:07:38,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:07:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 04:07:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-09 04:07:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 04:07:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-09 04:07:38,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-09 04:07:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:38,460 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-09 04:07:38,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:07:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-09 04:07:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 04:07:38,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:38,461 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:38,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:38,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:38,462 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-12-09 04:07:38,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:38,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:38,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:38,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:38,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:38,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:38,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:07:38,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:07:38,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 04:07:38,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:38,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:38,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:38,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:38,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:07:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 04:07:38,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:38,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 04:07:38,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-09 04:07:38,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,635 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:38,636 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:38,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 04:07:38,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:38,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:38,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 04:07:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 04:07:38,661 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:07:38,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 10 [2018-12-09 04:07:38,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:38,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:07:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:07:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:07:38,662 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2018-12-09 04:07:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:38,694 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-09 04:07:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:07:38,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 04:07:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:38,695 INFO L225 Difference]: With dead ends: 33 [2018-12-09 04:07:38,695 INFO L226 Difference]: Without dead ends: 25 [2018-12-09 04:07:38,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:07:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-09 04:07:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-09 04:07:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 04:07:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-09 04:07:38,697 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-09 04:07:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:38,697 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-09 04:07:38,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:07:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-09 04:07:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 04:07:38,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:38,698 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:38,698 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:38,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash -413303094, now seen corresponding path program 1 times [2018-12-09 04:07:38,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 04:07:38,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:38,727 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 04:07:38,727 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [21], [24], [29], [32], [34], [39], [42], [52], [55], [56], [57], [58], [59], [61], [62] [2018-12-09 04:07:38,728 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:07:38,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:07:38,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:07:38,761 INFO L272 AbstractInterpreter]: Visited 21 different actions 27 times. Merged at 2 different actions 4 times. Never widened. Performed 240 root evaluator evaluations with a maximum evaluation depth of 5. Performed 240 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 35 variables. [2018-12-09 04:07:38,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:38,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:07:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:38,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:38,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:07:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 04:07:38,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 04:07:38,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:38,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 04:07:38,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:38,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:07:38,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:07:38,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:07:38,831 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2018-12-09 04:07:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:38,854 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-09 04:07:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:07:38,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-09 04:07:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:38,855 INFO L225 Difference]: With dead ends: 42 [2018-12-09 04:07:38,855 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 04:07:38,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:07:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 04:07:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-09 04:07:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 04:07:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-09 04:07:38,859 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-09 04:07:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:38,859 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-09 04:07:38,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:07:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-09 04:07:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 04:07:38,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:38,860 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:38,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:38,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 2 times [2018-12-09 04:07:38,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:38,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 04:07:38,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:38,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:38,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:38,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:38,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:38,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:07:38,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:07:38,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 04:07:38,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:38,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:38,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:38,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:38,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:38,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:07:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 04:07:38,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:39,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 04:07:39,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:39,038 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:39,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 04:07:39,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-09 04:07:39,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:39,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:39,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 04:07:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 04:07:39,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:39,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-09 04:07:39,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:39,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 04:07:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 04:07:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:07:39,076 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2018-12-09 04:07:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:39,136 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-09 04:07:39,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:07:39,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-12-09 04:07:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:39,136 INFO L225 Difference]: With dead ends: 46 [2018-12-09 04:07:39,136 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 04:07:39,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:07:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 04:07:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-09 04:07:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 04:07:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-09 04:07:39,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-12-09 04:07:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:39,139 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-09 04:07:39,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 04:07:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-09 04:07:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 04:07:39,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:39,140 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:39,140 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:39,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1042968311, now seen corresponding path program 3 times [2018-12-09 04:07:39,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 04:07:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:39,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:39,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:39,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:39,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:39,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 04:07:39,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 04:07:39,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 04:07:39,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:39,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:39,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:39,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:39,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:07:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 04:07:39,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:39,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 04:07:39,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 04:07:39,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,332 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:39,332 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:39,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 04:07:39,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:39,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:39,338 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 04:07:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 04:07:39,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:39,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-12-09 04:07:39,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:39,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:07:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:07:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-09 04:07:39,358 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-12-09 04:07:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:39,448 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-09 04:07:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:07:39,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-12-09 04:07:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:39,449 INFO L225 Difference]: With dead ends: 52 [2018-12-09 04:07:39,449 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 04:07:39,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-12-09 04:07:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 04:07:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 04:07:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 04:07:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-09 04:07:39,452 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-12-09 04:07:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:39,453 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-09 04:07:39,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:07:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-09 04:07:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 04:07:39,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:39,454 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:39,454 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:39,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:39,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1283972954, now seen corresponding path program 4 times [2018-12-09 04:07:39,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:39,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:39,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:07:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:39,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:39,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:39,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:39,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:39,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:39,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:07:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:39,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:07:39,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:07:39,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:39,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-12-09 04:07:39,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:39,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:07:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:07:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:07:39,597 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2018-12-09 04:07:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:39,619 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-09 04:07:39,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:07:39,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-12-09 04:07:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:39,620 INFO L225 Difference]: With dead ends: 56 [2018-12-09 04:07:39,620 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 04:07:39,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:07:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 04:07:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-09 04:07:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 04:07:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-09 04:07:39,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-09 04:07:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:39,623 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-09 04:07:39,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:07:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-09 04:07:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 04:07:39,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:39,624 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:39,624 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:39,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1797098632, now seen corresponding path program 5 times [2018-12-09 04:07:39,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:39,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:39,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:07:39,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:39,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:39,664 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:39,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:39,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:39,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:39,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:07:39,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:07:39,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 04:07:39,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:39,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:39,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:39,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:39,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:07:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 04:07:39,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:39,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 04:07:39,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-09 04:07:39,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,853 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:39,854 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:39,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 04:07:39,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:39,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:39,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:39,860 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 04:07:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 04:07:39,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:39,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2018-12-09 04:07:39,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:39,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 04:07:39,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 04:07:39,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-12-09 04:07:39,879 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 15 states. [2018-12-09 04:07:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:39,966 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-09 04:07:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:07:39,967 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-12-09 04:07:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:39,967 INFO L225 Difference]: With dead ends: 60 [2018-12-09 04:07:39,967 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 04:07:39,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-12-09 04:07:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 04:07:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-09 04:07:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 04:07:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-09 04:07:39,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2018-12-09 04:07:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:39,970 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-09 04:07:39,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 04:07:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-09 04:07:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 04:07:39,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:39,970 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:39,971 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:39,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1873077989, now seen corresponding path program 6 times [2018-12-09 04:07:39,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:39,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:07:40,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:40,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:40,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:40,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:40,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:40,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 04:07:40,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 04:07:40,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 04:07:40,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:40,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:40,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:40,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:40,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:40,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:40,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:40,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:07:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 04:07:40,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:40,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 04:07:40,180 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:40,181 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:40,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 04:07:40,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:40,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 04:07:40,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:40,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:40,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:40,193 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 04:07:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 04:07:40,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:40,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-09 04:07:40,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:40,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 04:07:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 04:07:40,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2018-12-09 04:07:40,213 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2018-12-09 04:07:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:40,308 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-09 04:07:40,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 04:07:40,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-09 04:07:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:40,308 INFO L225 Difference]: With dead ends: 66 [2018-12-09 04:07:40,308 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 04:07:40,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2018-12-09 04:07:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 04:07:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-09 04:07:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 04:07:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-09 04:07:40,311 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-12-09 04:07:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:40,311 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-09 04:07:40,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 04:07:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-09 04:07:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 04:07:40,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:40,312 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:40,312 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:40,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash -473244414, now seen corresponding path program 7 times [2018-12-09 04:07:40,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:40,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:40,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 04:07:40,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:40,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:40,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:40,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:40,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:40,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:40,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:40,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:07:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:40,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 04:07:40,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 04:07:40,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:40,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-12-09 04:07:40,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:40,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:07:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:07:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:07:40,498 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 12 states. [2018-12-09 04:07:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:40,532 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-09 04:07:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:07:40,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-12-09 04:07:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:40,533 INFO L225 Difference]: With dead ends: 70 [2018-12-09 04:07:40,533 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 04:07:40,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:07:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 04:07:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-12-09 04:07:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 04:07:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-09 04:07:40,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-09 04:07:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:40,535 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-09 04:07:40,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:07:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-09 04:07:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 04:07:40,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:40,536 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:40,536 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:40,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 432821860, now seen corresponding path program 8 times [2018-12-09 04:07:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:40,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 04:07:40,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:40,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:40,609 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:40,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:40,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:40,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:40,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:07:40,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:07:41,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 04:07:41,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:41,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:41,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 04:07:41,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 04:07:41,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2018-12-09 04:07:41,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:41,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:41,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:07:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 04:07:41,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 04:07:41,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:41,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2018-12-09 04:07:41,237 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:41,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 04:07:41,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 04:07:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-12-09 04:07:41,238 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 20 states. [2018-12-09 04:07:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:41,347 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-09 04:07:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 04:07:41,347 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-12-09 04:07:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:41,348 INFO L225 Difference]: With dead ends: 73 [2018-12-09 04:07:41,348 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 04:07:41,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2018-12-09 04:07:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 04:07:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-09 04:07:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 04:07:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-09 04:07:41,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-12-09 04:07:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:41,353 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-09 04:07:41,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 04:07:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-09 04:07:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 04:07:41,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:41,353 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:41,354 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:41,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash -597559487, now seen corresponding path program 9 times [2018-12-09 04:07:41,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:41,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:41,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:41,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 04:07:41,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:41,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:41,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:41,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:41,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:41,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:41,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 04:07:41,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 04:07:41,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 04:07:41,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:41,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:41,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:41,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:41,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:41,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:07:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 04:07:41,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:42,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 04:07:42,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 04:07:42,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:42,010 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:42,011 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:42,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 04:07:42,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:42,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:42,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:42,017 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 04:07:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 04:07:42,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:42,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 19 [2018-12-09 04:07:42,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:42,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 04:07:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 04:07:42,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-09 04:07:42,037 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 15 states. [2018-12-09 04:07:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,197 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-09 04:07:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:07:42,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-12-09 04:07:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,198 INFO L225 Difference]: With dead ends: 61 [2018-12-09 04:07:42,198 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 04:07:42,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=339, Invalid=783, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 04:07:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 04:07:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-09 04:07:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 04:07:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-09 04:07:42,201 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-09 04:07:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,201 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-09 04:07:42,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 04:07:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-09 04:07:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:07:42,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,202 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,202 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:42,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1410391164, now seen corresponding path program 10 times [2018-12-09 04:07:42,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 04:07:42,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:42,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:42,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:42,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:42,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:42,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:42,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:07:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:43,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:07:43,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:07:43,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-12-09 04:07:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 04:07:43,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:43,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 04:07:43,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-09 04:07:43,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,149 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:43,149 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:07:43,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 04:07:43,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:43,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:43,155 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 04:07:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 04:07:43,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:43,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 12] total 38 [2018-12-09 04:07:43,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:43,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 04:07:43,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 04:07:43,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 04:07:43,191 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 34 states. [2018-12-09 04:07:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:44,377 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-09 04:07:44,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 04:07:44,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 52 [2018-12-09 04:07:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:44,378 INFO L225 Difference]: With dead ends: 63 [2018-12-09 04:07:44,378 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 04:07:44,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2018-12-09 04:07:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 04:07:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-09 04:07:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 04:07:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-09 04:07:44,383 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-09 04:07:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:44,383 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-09 04:07:44,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 04:07:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-09 04:07:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 04:07:44,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:44,384 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:44,384 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:07:44,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1684316425, now seen corresponding path program 11 times [2018-12-09 04:07:44,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:44,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:44,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 20 proven. 148 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 04:07:44,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:44,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:44,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:44,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:44,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:44,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/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-09 04:07:44,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:07:44,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:08:02,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-09 04:08:02,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:08:02,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:02,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 04:08:02,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-09 04:08:02,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 04:08:02,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 04:08:02,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-12-09 04:08:02,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 04:08:02,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 04:08:02,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:02,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 04:08:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 04:08:02,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:08:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 04:08:02,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:08:02,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 13] total 27 [2018-12-09 04:08:02,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:08:02,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 04:08:02,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 04:08:02,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2018-12-09 04:08:02,791 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 26 states. [2018-12-09 04:08:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:08:03,037 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-09 04:08:03,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 04:08:03,038 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-12-09 04:08:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:08:03,038 INFO L225 Difference]: With dead ends: 67 [2018-12-09 04:08:03,038 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 04:08:03,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 101 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 04:08:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 04:08:03,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-09 04:08:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 04:08:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-09 04:08:03,041 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-12-09 04:08:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:08:03,041 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-09 04:08:03,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 04:08:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-09 04:08:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 04:08:03,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:08:03,042 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:03,042 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:08:03,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash -875693139, now seen corresponding path program 12 times [2018-12-09 04:08:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:08:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:03,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:03,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:08:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:03,174 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 04:08:03,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:08:03 BoogieIcfgContainer [2018-12-09 04:08:03,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:08:03,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:08:03,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:08:03,204 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:08:03,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:07:37" (3/4) ... [2018-12-09 04:08:03,206 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 04:08:03,242 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_48e8b2a2-acec-49d1-b3fa-412a3ccec815/bin-2019/utaipan/witness.graphml [2018-12-09 04:08:03,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:08:03,243 INFO L168 Benchmark]: Toolchain (without parser) took 25698.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 949.7 MB in the beginning and 870.1 MB in the end (delta: 79.6 MB). Peak memory consumption was 299.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:03,243 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:08:03,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.82 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:03,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.18 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 935.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:03,244 INFO L168 Benchmark]: Boogie Preprocessor took 46.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:03,244 INFO L168 Benchmark]: RCFGBuilder took 147.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:03,244 INFO L168 Benchmark]: TraceAbstraction took 25315.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 870.1 MB in the end (delta: 248.2 MB). Peak memory consumption was 331.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:03,244 INFO L168 Benchmark]: Witness Printer took 38.45 ms. Allocated memory is still 1.2 GB. Free memory is still 870.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:08:03,245 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 134.82 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.18 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 935.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 147.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25315.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 870.1 MB in the end (delta: 248.2 MB). Peak memory consumption was 331.0 MB. Max. memory is 11.5 GB. * Witness Printer took 38.45 ms. Allocated memory is still 1.2 GB. Free memory is still 870.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=0, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=0, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:0}, cont.array[0].b=5, i=0, j=10, pa={106:4}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=0, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=1, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=2, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=2, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=3, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=3, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=4, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=4, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=5, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=5, j=10, pa={106:4}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 25.2s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 268 SDtfs, 191 SDslu, 1668 SDs, 0 SdLazy, 1170 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1196 GetRequests, 854 SyntacticMatches, 49 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2641 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 18.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 993 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1428 ConstructedInterpolants, 0 QuantifiedInterpolants, 181489 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1934 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 41 InterpolantComputations, 4 PerfectInterpolantSequences, 1198/2619 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...