./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --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_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/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 ef034042979fe1e524a3655a8992190a25335ff0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/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 ef034042979fe1e524a3655a8992190a25335ff0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:04:10,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:04:10,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:04:10,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:04:10,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:04:10,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:04:10,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:04:10,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:04:10,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:04:10,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:04:10,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:04:10,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:04:10,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:04:10,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:04:10,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:04:10,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:04:10,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:04:10,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:04:10,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:04:10,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:04:10,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:04:10,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:04:10,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:04:10,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:04:10,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:04:10,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:04:10,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:04:10,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:04:10,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:04:10,195 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:04:10,195 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:04:10,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:04:10,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:04:10,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:04:10,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:04:10,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:04:10,197 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 07:04:10,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:04:10,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:04:10,205 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:04:10,205 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:04:10,205 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:04:10,205 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:04:10,205 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:04:10,205 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 07:04:10,205 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:04:10,206 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:04:10,206 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 07:04:10,206 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 07:04:10,206 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:04:10,206 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:04:10,206 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:04:10,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:04:10,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:04:10,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:04:10,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:04:10,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:04:10,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:04:10,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:04:10,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:04:10,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:04:10,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:04:10,208 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 07:04:10,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:04:10,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 07:04:10,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 07:04:10,209 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_b1e4174d-d170-4f21-87e0-eeec74aab465/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2018-12-02 07:04:10,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:04:10,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:04:10,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:04:10,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:04:10,241 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:04:10,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 07:04:10,278 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/a904da85b/ec66b6f346fd4f33ac529f9307279e74/FLAG8e467aa49 [2018-12-02 07:04:10,692 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:04:10,692 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 07:04:10,698 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/a904da85b/ec66b6f346fd4f33ac529f9307279e74/FLAG8e467aa49 [2018-12-02 07:04:10,706 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/a904da85b/ec66b6f346fd4f33ac529f9307279e74 [2018-12-02 07:04:10,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:04:10,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:04:10,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:04:10,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:04:10,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:04:10,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:10,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392409d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10, skipping insertion in model container [2018-12-02 07:04:10,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:10,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:04:10,738 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:04:10,886 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:04:10,892 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:04:10,953 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:04:10,987 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:04:10,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10 WrapperNode [2018-12-02 07:04:10,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:04:10,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:04:10,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:04:10,988 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:04:10,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:04:11,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:04:11,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:04:11,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:04:11,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... [2018-12-02 07:04:11,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:04:11,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:04:11,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:04:11,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:04:11,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:04:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-02 07:04:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-02 07:04:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 07:04:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 07:04:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-02 07:04:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-02 07:04:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:04:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:04:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-02 07:04:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-02 07:04:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 07:04:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 07:04:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:04:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 07:04:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 07:04:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:04:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:04:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:04:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:04:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 07:04:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 07:04:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:04:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:04:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:04:11,224 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:04:11,225 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 07:04:11,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:04:11 BoogieIcfgContainer [2018-12-02 07:04:11,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:04:11,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:04:11,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:04:11,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:04:11,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:04:10" (1/3) ... [2018-12-02 07:04:11,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316828c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:04:11, skipping insertion in model container [2018-12-02 07:04:11,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:10" (2/3) ... [2018-12-02 07:04:11,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316828c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:04:11, skipping insertion in model container [2018-12-02 07:04:11,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:04:11" (3/3) ... [2018-12-02 07:04:11,231 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 07:04:11,236 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:04:11,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 07:04:11,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 07:04:11,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:04:11,270 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:04:11,270 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:04:11,270 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:04:11,270 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:04:11,270 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:04:11,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:04:11,270 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:04:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-12-02 07:04:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 07:04:11,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:11,286 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, 1, 1, 1, 1, 1] [2018-12-02 07:04:11,287 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:11,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1637370932, now seen corresponding path program 1 times [2018-12-02 07:04:11,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:11,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:11,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:04:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:04:11,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:04:11,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:04:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:04:11,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:04:11,429 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-12-02 07:04:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:11,480 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-12-02 07:04:11,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:04:11,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-02 07:04:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:11,489 INFO L225 Difference]: With dead ends: 97 [2018-12-02 07:04:11,489 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 07:04:11,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:04:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 07:04:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-02 07:04:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 07:04:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 07:04:11,519 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2018-12-02 07:04:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:11,520 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 07:04:11,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:04:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-02 07:04:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 07:04:11,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:11,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:11,521 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:11,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2053071435, now seen corresponding path program 1 times [2018-12-02 07:04:11,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:11,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:11,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:11,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:11,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:11,585 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-02 07:04:11,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:11,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:11,586 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-02 07:04:11,587 INFO L205 CegarAbsIntRunner]: [15], [17], [23], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 07:04:11,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:04:11,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:04:11,744 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 07:04:11,745 INFO L272 AbstractInterpreter]: Visited 23 different actions 46 times. Merged at 7 different actions 11 times. Never widened. Performed 411 root evaluator evaluations with a maximum evaluation depth of 3. Performed 411 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-02 07:04:11,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:11,750 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 07:04:11,795 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 88.11% of their original sizes. [2018-12-02 07:04:11,795 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 07:04:11,865 INFO L418 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-12-02 07:04:11,865 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 07:04:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:04:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-12-02 07:04:11,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:04:11,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 07:04:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 07:04:11,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:04:11,867 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 14 states. [2018-12-02 07:04:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:12,504 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-12-02 07:04:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 07:04:12,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-12-02 07:04:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:12,504 INFO L225 Difference]: With dead ends: 66 [2018-12-02 07:04:12,505 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 07:04:12,505 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-12-02 07:04:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 07:04:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-12-02 07:04:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 07:04:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 07:04:12,510 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2018-12-02 07:04:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:12,511 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 07:04:12,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 07:04:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 07:04:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 07:04:12,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:12,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:12,512 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:12,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1676985131, now seen corresponding path program 1 times [2018-12-02 07:04:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:12,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:12,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 07:04:12,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:12,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:12,567 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-02 07:04:12,567 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 07:04:12,568 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:04:12,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:04:12,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 07:04:12,599 INFO L272 AbstractInterpreter]: Visited 31 different actions 62 times. Merged at 9 different actions 13 times. Never widened. Performed 539 root evaluator evaluations with a maximum evaluation depth of 4. Performed 539 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 27 variables. [2018-12-02 07:04:12,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:12,600 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 07:04:12,629 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-12-02 07:04:12,629 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 07:04:12,762 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-02 07:04:12,762 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 07:04:12,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:04:12,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-12-02 07:04:12,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:04:12,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 07:04:12,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 07:04:12,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-12-02 07:04:12,763 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 20 states. [2018-12-02 07:04:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:13,556 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-12-02 07:04:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 07:04:13,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-12-02 07:04:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:13,559 INFO L225 Difference]: With dead ends: 87 [2018-12-02 07:04:13,559 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 07:04:13,559 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2018-12-02 07:04:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 07:04:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-12-02 07:04:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 07:04:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-12-02 07:04:13,566 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 42 [2018-12-02 07:04:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:13,566 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-02 07:04:13,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 07:04:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-12-02 07:04:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 07:04:13,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:13,568 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:13,568 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:13,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash 736616856, now seen corresponding path program 1 times [2018-12-02 07:04:13,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:13,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:13,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:13,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:13,610 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-02 07:04:13,610 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 07:04:13,611 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:04:13,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:04:13,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:04:13,642 INFO L272 AbstractInterpreter]: Visited 43 different actions 88 times. Merged at 11 different actions 18 times. Never widened. Performed 693 root evaluator evaluations with a maximum evaluation depth of 4. Performed 693 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 4 different actions. Largest state had 27 variables. [2018-12-02 07:04:13,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:13,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:04:13,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:13,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:13,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:13,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:04:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:13,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:13,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:13,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:04:13,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-12-02 07:04:13,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:04:13,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:04:13,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:04:13,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:04:13,795 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 6 states. [2018-12-02 07:04:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:13,834 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2018-12-02 07:04:13,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:04:13,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-02 07:04:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:13,835 INFO L225 Difference]: With dead ends: 103 [2018-12-02 07:04:13,835 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 07:04:13,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:04:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 07:04:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-12-02 07:04:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 07:04:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-12-02 07:04:13,845 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 51 [2018-12-02 07:04:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:13,845 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-12-02 07:04:13,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:04:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-12-02 07:04:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 07:04:13,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:13,846 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:13,846 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:13,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -105291945, now seen corresponding path program 2 times [2018-12-02 07:04:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:13,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:14,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:14,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:14,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:04:14,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:04:14,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:14,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:14,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:04:14,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:04:14,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 07:04:14,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:04:14,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:14,595 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 6 treesize of output 5 [2018-12-02 07:04:14,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 07:04:14,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:14,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:14,653 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:14,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 07:04:14,660 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 11 treesize of output 8 [2018-12-02 07:04:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:04:14,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 07:04:14,776 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 11 treesize of output 8 [2018-12-02 07:04:14,778 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 8 treesize of output 7 [2018-12-02 07:04:14,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-12-02 07:04:14,825 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 26 treesize of output 21 [2018-12-02 07:04:14,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:14,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 07:04:14,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:14,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2018-12-02 07:04:15,357 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int) (sll_update_at_~data Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-02 07:04:15,361 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 34 treesize of output 28 [2018-12-02 07:04:15,363 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:04:15,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-02 07:04:15,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:15,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:15,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-02 07:04:15,378 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 8 treesize of output 7 [2018-12-02 07:04:15,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:15,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:15,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:15,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:18 [2018-12-02 07:04:15,502 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 22 treesize of output 16 [2018-12-02 07:04:15,503 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-02 07:04:15,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:15,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:15,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:15,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-12-02 07:04:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 07:04:15,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:15,898 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 07:04:15,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 07:04:16,043 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 07:04:16,048 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 07:04:16,502 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-02 07:04:16,505 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 07:04:16,509 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 07:04:16,843 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 07:04:17,295 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-02 07:04:17,336 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-12-02 07:04:17,350 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 9 treesize of output 8 [2018-12-02 07:04:17,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,364 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 23 treesize of output 21 [2018-12-02 07:04:17,366 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 07:04:17,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,374 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 16 treesize of output 12 [2018-12-02 07:04:17,376 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-02 07:04:17,376 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 07:04:17,421 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,426 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,429 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,430 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,433 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,455 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-12-02 07:04:17,470 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 9 treesize of output 8 [2018-12-02 07:04:17,470 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,484 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 23 treesize of output 21 [2018-12-02 07:04:17,487 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 07:04:17,487 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,492 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,494 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 16 treesize of output 12 [2018-12-02 07:04:17,496 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-02 07:04:17,496 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,498 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,509 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 07:04:17,542 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,545 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,547 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,549 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:17,550 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,554 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:17,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-02 07:04:17,574 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:121, output treesize:65 [2018-12-02 07:04:18,150 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-02 07:04:18,158 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-12-02 07:04:18,174 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 9 treesize of output 8 [2018-12-02 07:04:18,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,194 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 22 [2018-12-02 07:04:18,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-12-02 07:04:18,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 07:04:18,208 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 17 treesize of output 15 [2018-12-02 07:04:18,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,216 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 07:04:18,216 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:18,222 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 23 treesize of output 21 [2018-12-02 07:04:18,224 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 07:04:18,224 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,227 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-02 07:04:18,325 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,329 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,330 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,333 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,333 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,337 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,338 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,341 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,341 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,344 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,345 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,350 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,351 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,355 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,417 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,423 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:18,476 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-12-02 07:04:18,492 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 9 treesize of output 8 [2018-12-02 07:04:18,492 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,510 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 22 [2018-12-02 07:04:18,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-12-02 07:04:18,515 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-12-02 07:04:18,522 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-02 07:04:18,523 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,529 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 11 treesize of output 9 [2018-12-02 07:04:18,530 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,534 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:18,535 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 31 treesize of output 29 [2018-12-02 07:04:18,537 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 07:04:18,537 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,540 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:18,554 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-02 07:04:18,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 11 xjuncts. [2018-12-02 07:04:18,638 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 8 variables, input treesize:149, output treesize:300 [2018-12-02 07:04:18,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-02 07:04:19,076 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 18 treesize of output 16 [2018-12-02 07:04:19,078 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-02 07:04:19,081 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-02 07:04:19,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:19,082 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:19,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:19,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:19,083 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2018-12-02 07:04:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:19,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:04:19,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29, 29] total 70 [2018-12-02 07:04:19,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:04:19,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-02 07:04:19,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-02 07:04:19,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4482, Unknown=8, NotChecked=134, Total=4830 [2018-12-02 07:04:19,411 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 46 states. [2018-12-02 07:04:22,798 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-12-02 07:04:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:25,020 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-12-02 07:04:25,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 07:04:25,021 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 60 [2018-12-02 07:04:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:25,022 INFO L225 Difference]: With dead ends: 128 [2018-12-02 07:04:25,022 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 07:04:25,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=628, Invalid=9868, Unknown=14, NotChecked=202, Total=10712 [2018-12-02 07:04:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 07:04:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2018-12-02 07:04:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 07:04:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-12-02 07:04:25,041 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 60 [2018-12-02 07:04:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:25,042 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-12-02 07:04:25,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-02 07:04:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-12-02 07:04:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 07:04:25,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:25,043 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:25,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:25,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -849271432, now seen corresponding path program 1 times [2018-12-02 07:04:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 07:04:25,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:25,092 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-12-02 07:04:25,092 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 07:04:25,094 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:04:25,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:04:25,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:04:25,147 INFO L272 AbstractInterpreter]: Visited 44 different actions 124 times. Merged at 15 different actions 37 times. Widened at 1 different actions 1 times. Performed 1008 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 6 different actions. Largest state had 27 variables. [2018-12-02 07:04:25,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:04:25,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:25,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:04:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 07:04:25,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 07:04:25,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:04:25,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-02 07:04:25,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:04:25,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:04:25,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:04:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:04:25,263 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 5 states. [2018-12-02 07:04:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:25,298 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-12-02 07:04:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:04:25,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-02 07:04:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:25,299 INFO L225 Difference]: With dead ends: 104 [2018-12-02 07:04:25,299 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 07:04:25,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:04:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 07:04:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-12-02 07:04:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 07:04:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2018-12-02 07:04:25,310 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 61 [2018-12-02 07:04:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:25,310 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2018-12-02 07:04:25,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:04:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-12-02 07:04:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 07:04:25,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:25,311 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:25,311 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:25,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1151488352, now seen corresponding path program 3 times [2018-12-02 07:04:25,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:25,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 07:04:25,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:25,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:04:25,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:04:25,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:25,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:04:25,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:04:25,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:04:25,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:04:25,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:25,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:25,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:04:25,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-02 07:04:25,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:04:25,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 07:04:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 07:04:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:04:25,510 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 8 states. [2018-12-02 07:04:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:25,580 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2018-12-02 07:04:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:04:25,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-12-02 07:04:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:25,581 INFO L225 Difference]: With dead ends: 142 [2018-12-02 07:04:25,581 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 07:04:25,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:04:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 07:04:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-12-02 07:04:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 07:04:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-12-02 07:04:25,595 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 61 [2018-12-02 07:04:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:25,595 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2018-12-02 07:04:25,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 07:04:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-12-02 07:04:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 07:04:25,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:25,596 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:25,596 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:25,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1638853044, now seen corresponding path program 4 times [2018-12-02 07:04:25,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:25,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 07:04:25,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:25,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:04:25,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:04:25,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:25,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:04:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 07:04:25,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 07:04:25,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:04:25,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 07:04:25,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:04:25,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 07:04:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 07:04:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:04:25,759 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 8 states. [2018-12-02 07:04:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:25,813 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-12-02 07:04:25,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:04:25,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-12-02 07:04:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:25,814 INFO L225 Difference]: With dead ends: 124 [2018-12-02 07:04:25,814 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 07:04:25,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:04:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 07:04:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-12-02 07:04:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 07:04:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-12-02 07:04:25,825 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 61 [2018-12-02 07:04:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:25,826 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-12-02 07:04:25,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 07:04:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-12-02 07:04:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 07:04:25,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:25,827 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:25,827 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:25,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1196256737, now seen corresponding path program 5 times [2018-12-02 07:04:25,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:25,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 07:04:25,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:25,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:04:25,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:04:25,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:25,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:25,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:04:25,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:04:25,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 07:04:25,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:04:25,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 07:04:25,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 07:04:25,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:04:25,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 10 [2018-12-02 07:04:25,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:04:25,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:04:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:04:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:04:25,995 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 7 states. [2018-12-02 07:04:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:26,052 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2018-12-02 07:04:26,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:04:26,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-12-02 07:04:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:26,053 INFO L225 Difference]: With dead ends: 119 [2018-12-02 07:04:26,053 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 07:04:26,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:04:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 07:04:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-12-02 07:04:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 07:04:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-02 07:04:26,066 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 68 [2018-12-02 07:04:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:26,067 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-02 07:04:26,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:04:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-02 07:04:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 07:04:26,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:26,067 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:26,067 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:26,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash 541815126, now seen corresponding path program 6 times [2018-12-02 07:04:26,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:26,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:26,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:26,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:26,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 07:04:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:26,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:26,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:04:26,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:04:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:26,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:26,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:04:26,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:04:26,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:04:26,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:04:26,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 07:04:26,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 07:04:26,256 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:04:26,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-12-02 07:04:26,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:04:26,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:04:26,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:04:26,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:04:26,256 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 6 states. [2018-12-02 07:04:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:26,286 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-12-02 07:04:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:04:26,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 07:04:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:26,287 INFO L225 Difference]: With dead ends: 121 [2018-12-02 07:04:26,287 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 07:04:26,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:04:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 07:04:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 07:04:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 07:04:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-12-02 07:04:26,293 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 69 [2018-12-02 07:04:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:26,294 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-12-02 07:04:26,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:04:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-12-02 07:04:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 07:04:26,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:26,294 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:26,294 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:26,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:26,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1242182050, now seen corresponding path program 1 times [2018-12-02 07:04:26,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:26,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:26,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:26,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:26,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:04:26,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:26,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:26,324 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-12-02 07:04:26,325 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 07:04:26,326 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:04:26,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:04:26,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:04:26,383 INFO L272 AbstractInterpreter]: Visited 45 different actions 145 times. Merged at 23 different actions 44 times. Never widened. Performed 1191 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 27 variables. [2018-12-02 07:04:26,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:26,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:04:26,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:26,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:26,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:26,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:04:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:26,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:04:26,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:04:26,479 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:04:26,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-02 07:04:26,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:04:26,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:04:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:04:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:04:26,480 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-12-02 07:04:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:26,512 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-02 07:04:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:04:26,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-02 07:04:26,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:26,513 INFO L225 Difference]: With dead ends: 69 [2018-12-02 07:04:26,513 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 07:04:26,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:04:26,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 07:04:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 07:04:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 07:04:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-02 07:04:26,519 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 70 [2018-12-02 07:04:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:26,520 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-02 07:04:26,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:04:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-02 07:04:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 07:04:26,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:26,520 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:26,520 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:26,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2027250547, now seen corresponding path program 1 times [2018-12-02 07:04:26,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:04:26,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:26,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:26,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:04:26,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:04:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 07:04:27,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:27,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:04:27,133 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-02 07:04:27,133 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 07:04:27,134 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:04:27,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:04:27,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:04:27,195 INFO L272 AbstractInterpreter]: Visited 46 different actions 190 times. Merged at 27 different actions 76 times. Widened at 2 different actions 2 times. Performed 1378 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 8 different actions. Largest state had 27 variables. [2018-12-02 07:04:27,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:27,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:04:27,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:27,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:27,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:27,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:04:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:27,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:27,266 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 6 treesize of output 5 [2018-12-02 07:04:27,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 07:04:27,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:27,361 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:27,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 07:04:27,388 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 11 treesize of output 8 [2018-12-02 07:04:27,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 07:04:27,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 07:04:27,546 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-02 07:04:27,547 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-02 07:04:27,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:27,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:27,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-12-02 07:04:28,026 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-02 07:04:28,030 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 24 treesize of output 19 [2018-12-02 07:04:28,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:28,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-02 07:04:28,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-12-02 07:04:28,162 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 29 treesize of output 20 [2018-12-02 07:04:28,164 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 20 treesize of output 19 [2018-12-02 07:04:28,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-02 07:04:28,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:28,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-12-02 07:04:28,232 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 36 treesize of output 1 [2018-12-02 07:04:28,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:28,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-12-02 07:04:28,248 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 36 treesize of output 1 [2018-12-02 07:04:28,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:126, output treesize:36 [2018-12-02 07:04:28,725 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 62 treesize of output 60 [2018-12-02 07:04:28,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-02 07:04:28,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-12-02 07:04:28,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,759 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-12-02 07:04:28,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 07:04:28,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-02 07:04:28,791 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 9 treesize of output 7 [2018-12-02 07:04:28,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,798 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 19 treesize of output 15 [2018-12-02 07:04:28,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 44 [2018-12-02 07:04:28,811 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 40 treesize of output 36 [2018-12-02 07:04:28,812 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,823 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 27 treesize of output 23 [2018-12-02 07:04:28,824 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,835 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 36 treesize of output 34 [2018-12-02 07:04:28,836 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:28,847 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 07:04:28,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 36 [2018-12-02 07:04:28,871 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-12-02 07:04:28,871 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-02 07:04:28,885 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,894 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-02 07:04:28,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-02 07:04:28,897 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,902 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 07:04:28,904 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 07:04:28,905 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,908 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:28,919 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 5 variables, input treesize:65, output treesize:7 [2018-12-02 07:04:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-02 07:04:28,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:29,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,442 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,451 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,458 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,592 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 109 treesize of output 75 [2018-12-02 07:04:29,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 07:04:29,594 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,597 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 135 treesize of output 101 [2018-12-02 07:04:29,601 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 5 [2018-12-02 07:04:29,601 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,605 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,606 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 99 treesize of output 65 [2018-12-02 07:04:29,608 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 5 [2018-12-02 07:04:29,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,611 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,668 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,674 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,675 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,681 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,682 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,687 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,738 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,743 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,744 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,749 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,750 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,754 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,801 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 115 treesize of output 81 [2018-12-02 07:04:29,802 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-02 07:04:29,803 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,804 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 115 treesize of output 81 [2018-12-02 07:04:29,807 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 39 treesize of output 5 [2018-12-02 07:04:29,807 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,808 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,832 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,833 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,834 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,835 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:29,835 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,836 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:29,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-12-02 07:04:29,852 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:281, output treesize:260 [2018-12-02 07:04:30,064 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 07:04:30,352 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:30,353 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 07:04:30,358 INFO L168 Benchmark]: Toolchain (without parser) took 19649.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.0 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -376.0 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:30,359 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:04:30,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:30,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:04:30,360 INFO L168 Benchmark]: Boogie Preprocessor took 18.87 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:30,361 INFO L168 Benchmark]: RCFGBuilder took 200.37 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:30,361 INFO L168 Benchmark]: TraceAbstraction took 19131.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:04:30,362 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.87 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.37 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19131.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:04:31,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:04:31,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:04:31,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:04:31,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:04:31,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:04:31,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:04:31,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:04:31,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:04:31,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:04:31,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:04:31,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:04:31,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:04:31,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:04:31,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:04:31,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:04:31,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:04:31,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:04:31,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:04:31,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:04:31,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:04:31,690 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:04:31,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:04:31,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:04:31,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:04:31,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:04:31,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:04:31,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:04:31,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:04:31,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:04:31,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:04:31,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:04:31,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:04:31,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:04:31,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:04:31,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:04:31,696 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 07:04:31,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:04:31,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:04:31,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:04:31,704 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:04:31,704 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:04:31,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:04:31,704 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:04:31,704 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:04:31,704 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:04:31,705 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:04:31,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:04:31,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:04:31,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:04:31,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:04:31,706 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:04:31,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:04:31,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:04:31,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:04:31,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:04:31,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:04:31,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:04:31,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:04:31,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:04:31,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:04:31,708 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 07:04:31,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:04:31,708 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 07:04:31,708 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 07:04:31,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_b1e4174d-d170-4f21-87e0-eeec74aab465/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2018-12-02 07:04:31,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:04:31,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:04:31,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:04:31,740 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:04:31,740 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:04:31,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 07:04:31,782 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/72d2072c2/82103bcb184c4e52917aa837d119db32/FLAG56df56d0a [2018-12-02 07:04:32,205 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:04:32,205 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 07:04:32,211 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/72d2072c2/82103bcb184c4e52917aa837d119db32/FLAG56df56d0a [2018-12-02 07:04:32,219 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/data/72d2072c2/82103bcb184c4e52917aa837d119db32 [2018-12-02 07:04:32,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:04:32,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:04:32,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:04:32,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:04:32,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:04:32,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33327ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32, skipping insertion in model container [2018-12-02 07:04:32,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:04:32,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:04:32,407 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:04:32,415 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:04:32,486 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:04:32,518 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:04:32,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32 WrapperNode [2018-12-02 07:04:32,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:04:32,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:04:32,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:04:32,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:04:32,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:04:32,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:04:32,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:04:32,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:04:32,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... [2018-12-02 07:04:32,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:04:32,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:04:32,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:04:32,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:04:32,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:04:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-02 07:04:32,589 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-02 07:04:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 07:04:32,589 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 07:04:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-02 07:04:32,589 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-02 07:04:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:04:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-02 07:04:32,590 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 07:04:32,590 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 07:04:32,590 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:04:32,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:04:32,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:04:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 07:04:32,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:04:32,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:04:32,794 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:04:32,794 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 07:04:32,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:04:32 BoogieIcfgContainer [2018-12-02 07:04:32,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:04:32,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:04:32,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:04:32,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:04:32,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:04:32" (1/3) ... [2018-12-02 07:04:32,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416358e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:04:32, skipping insertion in model container [2018-12-02 07:04:32,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:04:32" (2/3) ... [2018-12-02 07:04:32,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416358e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:04:32, skipping insertion in model container [2018-12-02 07:04:32,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:04:32" (3/3) ... [2018-12-02 07:04:32,799 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 07:04:32,804 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:04:32,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 07:04:32,817 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 07:04:32,833 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:04:32,833 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:04:32,833 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:04:32,834 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:04:32,834 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:04:32,834 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:04:32,834 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:04:32,834 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:04:32,834 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:04:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-02 07:04:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 07:04:32,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:32,847 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, 1, 1, 1, 1] [2018-12-02 07:04:32,848 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:32,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash -131027277, now seen corresponding path program 1 times [2018-12-02 07:04:32,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:04:32,854 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:04:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:32,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:04:32,971 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 07:04:32,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:04:32,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:04:32,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:04:32,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:04:32,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:04:32,985 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-12-02 07:04:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:33,043 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-12-02 07:04:33,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:04:33,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-02 07:04:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:33,051 INFO L225 Difference]: With dead ends: 95 [2018-12-02 07:04:33,051 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 07:04:33,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:04:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 07:04:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-02 07:04:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 07:04:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-02 07:04:33,080 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-12-02 07:04:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:33,080 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-02 07:04:33,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:04:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-02 07:04:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 07:04:33,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:33,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:33,081 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:33,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1869041009, now seen corresponding path program 1 times [2018-12-02 07:04:33,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:04:33,082 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:04:33,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:33,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:33,182 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-02 07:04:33,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:33,293 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-02 07:04:33,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:33,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:33,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:33,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:33,381 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-02 07:04:33,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:33,591 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-02 07:04:33,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 07:04:33,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-12-02 07:04:33,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 07:04:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 07:04:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-02 07:04:33,607 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 16 states. [2018-12-02 07:04:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:33,770 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-02 07:04:33,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:04:33,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-12-02 07:04:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:33,772 INFO L225 Difference]: With dead ends: 73 [2018-12-02 07:04:33,772 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 07:04:33,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-12-02 07:04:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 07:04:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-12-02 07:04:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 07:04:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-12-02 07:04:33,777 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 33 [2018-12-02 07:04:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:33,777 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-12-02 07:04:33,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 07:04:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-12-02 07:04:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 07:04:33,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:33,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:33,779 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:33,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1464099955, now seen corresponding path program 2 times [2018-12-02 07:04:33,780 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:04:33,780 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:04:33,793 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 07:04:33,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 07:04:33,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:04:33,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 07:04:33,851 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 07:04:33,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:04:33,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:04:33,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:04:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:04:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:04:33,853 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2018-12-02 07:04:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:33,879 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-12-02 07:04:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:04:33,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-02 07:04:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:33,880 INFO L225 Difference]: With dead ends: 67 [2018-12-02 07:04:33,881 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 07:04:33,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:04:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 07:04:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-02 07:04:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 07:04:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-12-02 07:04:33,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2018-12-02 07:04:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:33,886 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-12-02 07:04:33,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:04:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-12-02 07:04:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 07:04:33,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:33,887 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:33,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:33,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1257371639, now seen corresponding path program 1 times [2018-12-02 07:04:33,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:04:33,887 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:04:33,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:33,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 07:04:34,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 07:04:34,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:34,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:34,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:34,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:34,141 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 11 treesize of output 8 [2018-12-02 07:04:34,144 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 8 treesize of output 7 [2018-12-02 07:04:34,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 07:04:34,315 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 31 treesize of output 31 [2018-12-02 07:04:34,319 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-12-02 07:04:34,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 07:04:34,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-02 07:04:34,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:31, output treesize:7 [2018-12-02 07:04:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 07:04:34,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:34,937 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 7 treesize of output 5 [2018-12-02 07:04:34,942 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 07:04:34,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:34,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:04:34,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-12-02 07:04:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 07:04:35,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 07:04:35,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14, 12] total 26 [2018-12-02 07:04:35,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 07:04:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 07:04:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-12-02 07:04:35,079 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 26 states. [2018-12-02 07:04:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:38,518 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-12-02 07:04:38,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 07:04:38,518 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-02 07:04:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:38,520 INFO L225 Difference]: With dead ends: 92 [2018-12-02 07:04:38,520 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 07:04:38,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 07:04:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 07:04:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2018-12-02 07:04:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 07:04:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-12-02 07:04:38,526 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 50 [2018-12-02 07:04:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:38,526 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-02 07:04:38,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 07:04:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-02 07:04:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 07:04:38,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:38,527 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:38,527 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:38,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1398950497, now seen corresponding path program 2 times [2018-12-02 07:04:38,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:04:38,528 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:04:38,541 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 07:04:38,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:04:38,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:04:38,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:38,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:38,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:38,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:38,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 07:04:38,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:04:38,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:04:38,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:38,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:04:38,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 07:04:38,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-02 07:04:38,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 07:04:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 07:04:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:04:38,797 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-12-02 07:04:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:04:38,909 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2018-12-02 07:04:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:04:38,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-12-02 07:04:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:04:38,910 INFO L225 Difference]: With dead ends: 95 [2018-12-02 07:04:38,910 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 07:04:38,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:04:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 07:04:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-12-02 07:04:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 07:04:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-12-02 07:04:38,916 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 58 [2018-12-02 07:04:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:04:38,917 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-12-02 07:04:38,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 07:04:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-12-02 07:04:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 07:04:38,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:04:38,917 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:04:38,917 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:04:38,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:04:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash 124593572, now seen corresponding path program 1 times [2018-12-02 07:04:38,918 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:04:38,918 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:04:38,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:04:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:39,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:39,087 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 6 treesize of output 5 [2018-12-02 07:04:39,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 07:04:39,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:39,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:39,141 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 07:04:39,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-02 07:04:39,165 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 11 treesize of output 8 [2018-12-02 07:04:39,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 07:04:39,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 07:04:39,349 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 11 treesize of output 8 [2018-12-02 07:04:39,352 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 8 treesize of output 7 [2018-12-02 07:04:39,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 07:04:39,429 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 24 treesize of output 19 [2018-12-02 07:04:39,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:39,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-02 07:04:39,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:39,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-12-02 07:04:41,217 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (bvadd |c_sll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-02 07:04:41,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:41,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-02 07:04:41,233 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 14 treesize of output 13 [2018-12-02 07:04:41,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:41,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:41,255 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 22 treesize of output 18 [2018-12-02 07:04:41,257 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:04:41,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-02 07:04:41,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:41,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:41,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:41,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-12-02 07:04:43,585 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 31 treesize of output 31 [2018-12-02 07:04:43,588 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-02 07:04:43,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:43,602 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 07:04:43,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:43,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:43,612 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-02 07:04:43,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 07:04:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 07:04:43,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:46,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:04:46,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:04:46,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:04:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:04:46,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:04:46,398 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 6 treesize of output 5 [2018-12-02 07:04:46,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 07:04:46,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:46,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:46,407 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:04:46,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 07:04:46,416 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 11 treesize of output 8 [2018-12-02 07:04:46,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 07:04:46,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 07:04:46,436 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 11 treesize of output 8 [2018-12-02 07:04:46,439 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 8 treesize of output 7 [2018-12-02 07:04:46,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 07:04:46,458 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 24 treesize of output 19 [2018-12-02 07:04:46,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:04:46,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-02 07:04:46,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-12-02 07:04:46,493 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 32 treesize of output 26 [2018-12-02 07:04:46,496 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:04:46,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-02 07:04:46,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:46,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:04:46,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 07:04:46,530 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 8 treesize of output 7 [2018-12-02 07:04:46,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:46,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-12-02 07:04:48,605 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 31 treesize of output 31 [2018-12-02 07:04:48,607 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2018-12-02 07:04:48,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:04:48,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:04:48,617 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-02 07:04:48,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-12-02 07:04:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 07:04:48,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:04:50,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:04:50,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-12-02 07:04:50,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 07:04:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 07:04:50,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1232, Unknown=3, NotChecked=70, Total=1406 [2018-12-02 07:04:50,965 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 31 states. [2018-12-02 07:05:19,132 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-02 07:05:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:05:32,808 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-12-02 07:05:32,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 07:05:32,808 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-12-02 07:05:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:05:32,809 INFO L225 Difference]: With dead ends: 98 [2018-12-02 07:05:32,809 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 07:05:32,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=273, Invalid=3137, Unknown=16, NotChecked=114, Total=3540 [2018-12-02 07:05:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 07:05:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-12-02 07:05:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 07:05:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2018-12-02 07:05:32,819 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 59 [2018-12-02 07:05:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:05:32,819 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2018-12-02 07:05:32,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 07:05:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2018-12-02 07:05:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 07:05:32,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:05:32,820 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:05:32,820 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:05:32,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:05:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1169347144, now seen corresponding path program 1 times [2018-12-02 07:05:32,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:05:32,821 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:05:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:05:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:05:32,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 07:05:32,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 07:05:32,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:05:32,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-02 07:05:32,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:05:32,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:05:32,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:05:32,986 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 7 states. [2018-12-02 07:05:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:05:33,040 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2018-12-02 07:05:33,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:05:33,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-12-02 07:05:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:05:33,041 INFO L225 Difference]: With dead ends: 118 [2018-12-02 07:05:33,042 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 07:05:33,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:05:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 07:05:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-12-02 07:05:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 07:05:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2018-12-02 07:05:33,052 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 60 [2018-12-02 07:05:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:05:33,053 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2018-12-02 07:05:33,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:05:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2018-12-02 07:05:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 07:05:33,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:05:33,054 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:05:33,054 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:05:33,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:05:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash 109819455, now seen corresponding path program 2 times [2018-12-02 07:05:33,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:05:33,054 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:05:33,076 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 07:05:33,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:05:33,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:05:33,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:05:33,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:05:33,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:05:33,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:05:33,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 07:05:33,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:05:33,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:05:33,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:05:33,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 07:05:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 07:05:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-02 07:05:33,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 07:05:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 07:05:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-02 07:05:33,819 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand 18 states. [2018-12-02 07:05:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:05:34,806 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2018-12-02 07:05:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 07:05:34,807 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-12-02 07:05:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:05:34,808 INFO L225 Difference]: With dead ends: 168 [2018-12-02 07:05:34,808 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 07:05:34,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-02 07:05:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 07:05:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-12-02 07:05:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 07:05:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-12-02 07:05:34,822 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 60 [2018-12-02 07:05:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:05:34,822 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2018-12-02 07:05:34,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 07:05:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2018-12-02 07:05:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 07:05:34,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:05:34,823 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:05:34,823 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:05:34,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:05:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash -616848017, now seen corresponding path program 1 times [2018-12-02 07:05:34,823 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:05:34,823 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:05:34,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:05:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:05:34,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:34,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:35,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:05:35,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:05:35,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:05:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:05:35,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:35,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:35,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 07:05:35,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-02 07:05:35,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 07:05:35,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 07:05:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:05:35,116 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 9 states. [2018-12-02 07:05:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:05:35,272 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2018-12-02 07:05:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:05:35,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-02 07:05:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:05:35,274 INFO L225 Difference]: With dead ends: 145 [2018-12-02 07:05:35,274 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 07:05:35,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:05:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 07:05:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2018-12-02 07:05:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 07:05:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2018-12-02 07:05:35,293 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 68 [2018-12-02 07:05:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:05:35,293 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2018-12-02 07:05:35,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 07:05:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2018-12-02 07:05:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 07:05:35,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:05:35,295 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:05:35,295 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:05:35,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:05:35,295 INFO L82 PathProgramCache]: Analyzing trace with hash 708191849, now seen corresponding path program 3 times [2018-12-02 07:05:35,295 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:05:35,296 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:05:35,316 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 07:05:35,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 07:05:35,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:05:35,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 07:05:35,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 07:05:35,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:05:35,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:05:35,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:05:41,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 07:05:41,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:05:41,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 07:05:41,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 07:05:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 07:05:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8, 12] total 18 [2018-12-02 07:05:41,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 07:05:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 07:05:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-02 07:05:41,844 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 18 states. [2018-12-02 07:05:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:05:41,978 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2018-12-02 07:05:41,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:05:41,978 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2018-12-02 07:05:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:05:41,979 INFO L225 Difference]: With dead ends: 134 [2018-12-02 07:05:41,979 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 07:05:41,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-02 07:05:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 07:05:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 07:05:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 07:05:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-02 07:05:41,986 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 68 [2018-12-02 07:05:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:05:41,986 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-02 07:05:41,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 07:05:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-02 07:05:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 07:05:41,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:05:41,987 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:05:41,987 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:05:41,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:05:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash -340505635, now seen corresponding path program 1 times [2018-12-02 07:05:41,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:05:41,988 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:05:42,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:05:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:05:42,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:42,188 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 6 treesize of output 5 [2018-12-02 07:05:42,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 07:05:42,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:42,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:42,239 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 07:05:42,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-02 07:05:42,262 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 11 treesize of output 8 [2018-12-02 07:05:42,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 07:05:42,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 07:05:42,429 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-02 07:05:42,431 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-02 07:05:42,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 07:05:42,493 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 24 treesize of output 19 [2018-12-02 07:05:42,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:42,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-02 07:05:42,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-12-02 07:05:42,788 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 29 treesize of output 20 [2018-12-02 07:05:42,793 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 20 treesize of output 19 [2018-12-02 07:05:42,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:42,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-02 07:05:42,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:42,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 115 [2018-12-02 07:05:42,992 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 36 treesize of output 1 [2018-12-02 07:05:42,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:43,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-12-02 07:05:43,037 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 36 treesize of output 1 [2018-12-02 07:05:43,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:42 [2018-12-02 07:05:43,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 50 treesize of output 48 [2018-12-02 07:05:43,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-12-02 07:05:43,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,960 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 17 treesize of output 21 [2018-12-02 07:05:43,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 07:05:43,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-02 07:05:43,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-02 07:05:43,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:43,986 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:11 [2018-12-02 07:05:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 07:05:44,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:45,292 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-02 07:05:45,412 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-02 07:05:45,509 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 21 treesize of output 13 [2018-12-02 07:05:45,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 07:05:45,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:45,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:45,570 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,574 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,575 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,579 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,611 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,614 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,615 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:45,618 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:45,619 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,621 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 07:05:45,639 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:140, output treesize:88 [2018-12-02 07:05:45,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:05:45,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:05:45,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:05:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:05:45,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:45,833 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 6 treesize of output 5 [2018-12-02 07:05:45,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 07:05:45,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:45,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:45,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:05:45,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 07:05:45,849 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 11 treesize of output 8 [2018-12-02 07:05:45,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 07:05:45,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 07:05:45,867 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-02 07:05:45,869 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-02 07:05:45,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 07:05:45,878 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 24 treesize of output 19 [2018-12-02 07:05:45,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:45,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-02 07:05:45,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:45,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-12-02 07:05:46,251 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 29 treesize of output 20 [2018-12-02 07:05:46,255 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 20 treesize of output 19 [2018-12-02 07:05:46,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:113 [2018-12-02 07:05:46,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:05:46,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 126 [2018-12-02 07:05:46,538 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 36 treesize of output 1 [2018-12-02 07:05:46,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-12-02 07:05:46,584 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 36 treesize of output 1 [2018-12-02 07:05:46,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:46,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:42 [2018-12-02 07:05:47,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 50 treesize of output 48 [2018-12-02 07:05:47,466 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-12-02 07:05:47,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,485 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-12-02 07:05:47,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-02 07:05:47,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,538 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 17 treesize of output 21 [2018-12-02 07:05:47,541 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 07:05:47,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,553 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-02 07:05:47,553 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,562 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-02 07:05:47,563 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:47,566 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:76, output treesize:9 [2018-12-02 07:05:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 07:05:47,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:49,070 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-02 07:05:49,333 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-02 07:05:49,480 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-02 07:05:49,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,642 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,643 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,661 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,823 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,848 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,848 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,869 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,870 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,888 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,889 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:49,906 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:05:50,132 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 79 treesize of output 45 [2018-12-02 07:05:50,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-02 07:05:50,138 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:50,141 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:50,145 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 115 treesize of output 81 [2018-12-02 07:05:50,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-02 07:05:50,149 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:50,153 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:50,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 115 treesize of output 81 [2018-12-02 07:05:50,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-02 07:05:50,164 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:05:50,169 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:05:50,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 07:05:50,224 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:148, output treesize:115 [2018-12-02 07:05:50,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:05:50,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 41 [2018-12-02 07:05:50,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-02 07:05:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-02 07:05:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3075, Unknown=21, NotChecked=0, Total=3306 [2018-12-02 07:05:50,508 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 41 states. [2018-12-02 07:05:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:05:54,755 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-02 07:05:54,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 07:05:54,756 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 69 [2018-12-02 07:05:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:05:54,757 INFO L225 Difference]: With dead ends: 73 [2018-12-02 07:05:54,757 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 07:05:54,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=432, Invalid=5552, Unknown=22, NotChecked=0, Total=6006 [2018-12-02 07:05:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 07:05:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-02 07:05:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 07:05:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-02 07:05:54,769 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 69 [2018-12-02 07:05:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:05:54,769 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-02 07:05:54,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-02 07:05:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-02 07:05:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 07:05:54,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:05:54,770 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:05:54,770 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:05:54,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:05:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash -363826385, now seen corresponding path program 2 times [2018-12-02 07:05:54,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 07:05:54,770 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 07:05:54,790 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 07:05:54,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:05:54,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:05:54,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:54,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:55,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:05:55,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1e4174d-d170-4f21-87e0-eeec74aab465/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:05:55,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 07:05:55,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:05:55,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:05:55,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:05:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:55,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:05:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 07:05:55,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 07:05:55,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-02 07:05:55,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 07:05:55,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 07:05:55,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-02 07:05:55,534 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 18 states. [2018-12-02 07:05:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:05:56,021 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-12-02 07:05:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 07:05:56,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-12-02 07:05:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:05:56,022 INFO L225 Difference]: With dead ends: 70 [2018-12-02 07:05:56,022 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 07:05:56,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-02 07:05:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 07:05:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 07:05:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 07:05:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 07:05:56,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-12-02 07:05:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:05:56,023 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:05:56,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 07:05:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:05:56,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 07:05:56,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 07:05:56,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 07:05:56,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 07:05:56,379 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2018-12-02 07:05:56,496 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-02 07:05:56,839 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2018-12-02 07:05:56,964 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-02 07:05:57,298 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2018-12-02 07:05:57,400 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-12-02 07:05:57,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 07:05:57,528 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-02 07:05:57,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:05:57,528 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-12-02 07:05:57,528 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 560 562) the Hoare annotation is: true [2018-12-02 07:05:57,528 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 560 562) no Hoare annotation was computed. [2018-12-02 07:05:57,528 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 560 562) no Hoare annotation was computed. [2018-12-02 07:05:57,528 INFO L448 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-12-02 07:05:57,528 INFO L451 ceAbstractionStarter]: At program point L582-2(lines 582 586) the Hoare annotation is: true [2018-12-02 07:05:57,528 INFO L451 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-12-02 07:05:57,528 INFO L448 ceAbstractionStarter]: For program point L582-3(lines 581 587) no Hoare annotation was computed. [2018-12-02 07:05:57,528 INFO L448 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-12-02 07:05:57,528 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (let ((.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse1 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse5 (and (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~head.base |sll_update_at_#in~head.base|) .cse0 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse2 .cse4 .cse1))) (and (or (and .cse0 .cse1 (bvsgt (bvadd |sll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse3 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (and .cse0 (= (bvadd sll_update_at_~index (_ bv1 32)) |sll_update_at_#in~index|) .cse2 (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) .cse3) sll_update_at_~head.base) .cse4 .cse1 (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse3) sll_update_at_~head.offset))) .cse5 (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32)))))) (or .cse5 (bvsgt |sll_update_at_#in~index| (_ bv0 32)))))) [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L444 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (let ((.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (and (or (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))) .cse0) (or .cse0 (bvsgt |sll_update_at_#in~index| (_ bv0 32))))) [2018-12-02 07:05:57,529 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse0 (bvsgt sll_create_~len (_ bv0 32)))) (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (or (and (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt |sll_create_#in~len| (_ bv0 32))) .cse0)) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L444 ceAbstractionStarter]: At program point L574-3(lines 574 578) the Hoare annotation is: (let ((.cse0 (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and .cse0 (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt |sll_create_#in~len| (_ bv0 32))) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)))) [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point L574-4(lines 574 578) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L444 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 07:05:57,529 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L444 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse0 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (= main_~s~0.offset (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 (= main_~i~0 (_ bv0 32)) .cse2) (and .cse0 .cse2 .cse1 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point L611-2(lines 611 616) no Hoare annotation was computed. [2018-12-02 07:05:57,529 INFO L448 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L444 ceAbstractionStarter]: At program point L611-3(lines 611 616) the Hoare annotation is: (let ((.cse10 (bvsgt main_~i~0 (_ bv0 32))) (.cse5 (= main_~i~0 (_ bv0 32))) (.cse9 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse7 (bvneg main_~len~0)) (.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse9)) (.cse3 (let ((.cse11 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse10 .cse11) (and .cse11 .cse5)))) (.cse4 (= main_~s~0.offset (_ bv0 32))) (.cse6 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (let ((.cse0 (and .cse10 (and .cse3 .cse4 .cse6))) (.cse1 (not (= .cse8 main_~s~0.base))) (.cse2 (= (bvadd (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)) (_ bv4294967295 32)) (bvneg .cse7)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse0 .cse1 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse2 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 (= (bvadd .cse7 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-02 07:05:57,530 INFO L444 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-02 07:05:57,530 INFO L444 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 07:05:57,530 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse7 (not (= (select .cse6 (_ bv4 32)) main_~s~0.base))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (or (let ((.cse4 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse6 .cse4)) (.cse5 (bvneg main_~len~0))) (and (not (= .cse0 main_~s~0.base)) .cse1 .cse2 .cse3 (= (bvadd (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse4)) (_ bv4294967295 32)) (bvneg .cse5)) (= (bvadd .cse5 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0)))) (and .cse7 .cse1 (= main_~i~0 (_ bv0 32)) .cse2) (and .cse7 (= main_~len~0 main_~new_data~0) .cse1 .cse2 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L444 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: false [2018-12-02 07:05:57,530 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L444 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse8 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse6 (bvneg main_~len~0)) (.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse8))) (let ((.cse0 (not (= .cse7 main_~s~0.base))) (.cse5 (= (bvadd (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse8)) (_ bv4294967295 32)) (bvneg .cse6))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse4 (= main_~len~0 .cse2))) (or (and .cse0 .cse1 (= main_~expected~0 .cse2) (= main_~i~0 (_ bv0 32)) .cse3 .cse4 .cse5 (= (bvadd .cse6 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (= (bvadd main_~expected~0 (_ bv4294967294 32)) main_~i~0) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse5 (and .cse1 .cse3 .cse4) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-12-02 07:05:57,530 INFO L451 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-12-02 07:05:57,530 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-12-02 07:05:57,531 INFO L444 ceAbstractionStarter]: At program point L589-2(lines 589 592) the Hoare annotation is: (let ((.cse1 (bvsgt |sll_get_data_at_#in~index| (_ bv0 32))) (.cse3 (bvadd |sll_get_data_at_#in~index| (_ bv4294967295 32)))) (or (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32))))) (= .cse0 v_main_~s~0.base_BEFORE_CALL_14)))) (let ((.cse2 (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (and .cse1 (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse2)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse2)) (= .cse3 sll_get_data_at_~index))) (and .cse1 (bvsgt .cse3 (_ bv0 32))) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|)))) [2018-12-02 07:05:57,531 INFO L448 ceAbstractionStarter]: For program point L589-3(lines 589 592) no Hoare annotation was computed. [2018-12-02 07:05:57,531 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-12-02 07:05:57,531 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 07:05:57,531 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-12-02 07:05:57,531 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-12-02 07:05:57,531 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-12-02 07:05:57,531 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-12-02 07:05:57,531 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-12-02 07:05:57,533 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 07:05:57,535 INFO L168 Benchmark]: Toolchain (without parser) took 85313.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 401.5 MB. Max. memory is 11.5 GB. [2018-12-02 07:05:57,535 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:05:57,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:05:57,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:05:57,536 INFO L168 Benchmark]: Boogie Preprocessor took 20.57 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 07:05:57,536 INFO L168 Benchmark]: RCFGBuilder took 236.37 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:05:57,536 INFO L168 Benchmark]: TraceAbstraction took 84739.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.1 MB). Peak memory consumption was 410.5 MB. Max. memory is 11.5 GB. [2018-12-02 07:05:57,537 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.57 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.37 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84739.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.1 MB). Peak memory consumption was 410.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...