./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_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_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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 fabf658906da38258bbb10e77b5550f740cea929 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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 fabf658906da38258bbb10e77b5550f740cea929 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 04:44:49,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:44:49,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:44:49,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:44:49,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:44:49,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:44:49,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:44:49,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:44:49,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:44:49,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:44:49,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:44:49,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:44:49,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:44:49,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:44:49,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:44:49,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:44:49,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:44:49,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:44:49,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:44:49,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:44:49,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:44:49,056 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:44:49,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:44:49,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:44:49,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:44:49,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:44:49,059 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:44:49,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:44:49,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:44:49,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:44:49,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:44:49,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:44:49,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:44:49,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:44:49,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:44:49,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:44:49,062 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 04:44:49,069 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:44:49,069 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:44:49,070 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:44:49,070 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:44:49,070 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:44:49,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:44:49,071 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:44:49,071 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:44:49,071 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:44:49,071 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:44:49,071 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:44:49,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:44:49,071 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:44:49,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:44:49,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:44:49,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:44:49,073 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:44:49,073 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:44:49,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:44:49,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:44:49,073 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 04:44:49,073 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_0a21b925-ab75-4667-8dc5-d62e387b67ee/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 -> fabf658906da38258bbb10e77b5550f740cea929 [2018-12-09 04:44:49,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:44:49,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:44:49,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:44:49,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:44:49,104 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:44:49,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:44:49,145 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/d655b8224/9426325eca044cf09e09847cae21ecc2/FLAGde6a6706a [2018-12-09 04:44:49,588 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:44:49,588 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:44:49,595 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/d655b8224/9426325eca044cf09e09847cae21ecc2/FLAGde6a6706a [2018-12-09 04:44:49,603 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/d655b8224/9426325eca044cf09e09847cae21ecc2 [2018-12-09 04:44:49,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:44:49,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:44:49,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:44:49,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:44:49,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:44:49,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5e1b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49, skipping insertion in model container [2018-12-09 04:44:49,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:44:49,634 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:44:49,790 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:44:49,828 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:44:49,864 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:44:49,888 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:44:49,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49 WrapperNode [2018-12-09 04:44:49,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:44:49,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:44:49,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:44:49,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:44:49,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:44:49,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:44:49,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:44:49,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:44:49,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... [2018-12-09 04:44:49,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:44:49,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:44:49,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:44:49,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:44:49,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:44:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 04:44:49,959 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 04:44:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 04:44:49,960 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 04:44:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:44:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:44:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-09 04:44:49,960 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-09 04:44:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:44:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-09 04:44:49,960 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-09 04:44:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 04:44:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 04:44:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 04:44:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 04:44:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 04:44:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 04:44:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:44:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 04:44:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 04:44:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:44:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:44:50,142 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:44:50,142 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 04:44:50,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:44:50 BoogieIcfgContainer [2018-12-09 04:44:50,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:44:50,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:44:50,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:44:50,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:44:50,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:44:49" (1/3) ... [2018-12-09 04:44:50,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590c8e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:44:50, skipping insertion in model container [2018-12-09 04:44:50,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:49" (2/3) ... [2018-12-09 04:44:50,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590c8e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:44:50, skipping insertion in model container [2018-12-09 04:44:50,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:44:50" (3/3) ... [2018-12-09 04:44:50,146 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:44:50,152 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:44:50,156 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 04:44:50,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 04:44:50,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:44:50,181 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:44:50,181 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:44:50,181 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:44:50,182 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:44:50,182 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:44:50,182 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:44:50,182 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:44:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-12-09 04:44:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 04:44:50,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:44:50,195 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-09 04:44:50,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:44:50,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:50,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2123187409, now seen corresponding path program 1 times [2018-12-09 04:44:50,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:44:50,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:50,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:44:50,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:50,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:44:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:44:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:44:50,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:44:50,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:44:50,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:44:50,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:44:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:44:50,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:44:50,325 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-12-09 04:44:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:44:50,375 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2018-12-09 04:44:50,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:44:50,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-09 04:44:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:44:50,381 INFO L225 Difference]: With dead ends: 95 [2018-12-09 04:44:50,381 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 04:44:50,383 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-09 04:44:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 04:44:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-09 04:44:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 04:44:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-09 04:44:50,406 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-12-09 04:44:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:44:50,406 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-09 04:44:50,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:44:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-09 04:44:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 04:44:50,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:44:50,407 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] [2018-12-09 04:44:50,407 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:44:50,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash -287578872, now seen corresponding path program 1 times [2018-12-09 04:44:50,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:44:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:50,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:44:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:50,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:44:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:44:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:44:50,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:44:50,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:44:50,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:44:50,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:44:50,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:44:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:44:50,454 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-12-09 04:44:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:44:50,468 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-12-09 04:44:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:44:50,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 04:44:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:44:50,469 INFO L225 Difference]: With dead ends: 73 [2018-12-09 04:44:50,469 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 04:44:50,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:44:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 04:44:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-09 04:44:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 04:44:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 04:44:50,474 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2018-12-09 04:44:50,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:44:50,474 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 04:44:50,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:44:50,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 04:44:50,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 04:44:50,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:44:50,475 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] [2018-12-09 04:44:50,475 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:44:50,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:50,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1976522614, now seen corresponding path program 1 times [2018-12-09 04:44:50,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:44:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:50,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:44:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:50,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:44:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:44:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:44:50,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:44:50,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:44:50,522 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-09 04:44:50,523 INFO L205 CegarAbsIntRunner]: [15], [22], [28], [29], [30], [32], [38], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [116], [118], [122], [123], [127], [128], [131], [132], [137], [138], [139] [2018-12-09 04:44:50,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:44:50,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:44:50,663 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 04:44:50,664 INFO L272 AbstractInterpreter]: Visited 14 different actions 19 times. Merged at 4 different actions 4 times. Never widened. Performed 177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-09 04:44:50,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:50,673 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 04:44:50,715 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 78.37% of their original sizes. [2018-12-09 04:44:50,716 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 04:44:50,759 INFO L418 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2018-12-09 04:44:50,759 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 04:44:50,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:44:50,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 04:44:50,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:44:50,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:44:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:44:50,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:44:50,760 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2018-12-09 04:44:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:44:51,031 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-09 04:44:51,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:44:51,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-09 04:44:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:44:51,032 INFO L225 Difference]: With dead ends: 73 [2018-12-09 04:44:51,032 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 04:44:51,033 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:44:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 04:44:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-12-09 04:44:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 04:44:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-09 04:44:51,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2018-12-09 04:44:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:44:51,039 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-09 04:44:51,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:44:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-09 04:44:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 04:44:51,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:44:51,040 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:44:51,040 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:44:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash -602728307, now seen corresponding path program 1 times [2018-12-09 04:44:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:44:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:51,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:44:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:51,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:44:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:44:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 04:44:51,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:44:51,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:44:51,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:44:51,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:44:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:44:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:44:51,085 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-12-09 04:44:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:44:51,117 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-12-09 04:44:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:44:51,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 04:44:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:44:51,119 INFO L225 Difference]: With dead ends: 70 [2018-12-09 04:44:51,119 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 04:44:51,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:44:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 04:44:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-12-09 04:44:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 04:44:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-09 04:44:51,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 35 [2018-12-09 04:44:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:44:51,128 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-09 04:44:51,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:44:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-12-09 04:44:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 04:44:51,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:44:51,129 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:44:51,130 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:44:51,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash -985974537, now seen corresponding path program 1 times [2018-12-09 04:44:51,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:44:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:51,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:44:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:51,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:44:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:44:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 04:44:51,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:44:51,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:44:51,186 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-09 04:44:51,187 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-09 04:44:51,189 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:44:51,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:44:51,257 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 04:44:51,257 INFO L272 AbstractInterpreter]: Visited 28 different actions 61 times. Merged at 11 different actions 21 times. Never widened. Performed 559 root evaluator evaluations with a maximum evaluation depth of 4. Performed 559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 27 variables. [2018-12-09 04:44:51,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:51,259 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 04:44:51,303 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 66.67% of their original sizes. [2018-12-09 04:44:51,303 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 04:44:51,468 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-09 04:44:51,468 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 04:44:51,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:44:51,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-12-09 04:44:51,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:44:51,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 04:44:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 04:44:51,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-09 04:44:51,469 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 17 states. [2018-12-09 04:44:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:44:52,299 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-12-09 04:44:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 04:44:52,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-12-09 04:44:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:44:52,301 INFO L225 Difference]: With dead ends: 75 [2018-12-09 04:44:52,301 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 04:44:52,301 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-12-09 04:44:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 04:44:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-09 04:44:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 04:44:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-12-09 04:44:52,307 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 43 [2018-12-09 04:44:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:44:52,307 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-12-09 04:44:52,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 04:44:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-12-09 04:44:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:44:52,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:44:52,309 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-09 04:44:52,309 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:44:52,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash 850280592, now seen corresponding path program 1 times [2018-12-09 04:44:52,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:44:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:44:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:44:52,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:44:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:44:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:44:52,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:44:52,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:44:52,942 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-09 04:44:52,943 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-09 04:44:52,944 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:44:52,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:44:52,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:44:52,993 INFO L272 AbstractInterpreter]: Visited 40 different actions 120 times. Merged at 23 different actions 46 times. Never widened. Performed 982 root evaluator evaluations with a maximum evaluation depth of 4. Performed 982 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 7 different actions. Largest state had 27 variables. [2018-12-09 04:44:52,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:44:52,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:44:52,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:44:52,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:44:53,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:44:53,005 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:44:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:44:53,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:44:53,071 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-09 04:44:53,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 04:44:53,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:44:53,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:44:53,113 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-09 04:44:53,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 04:44:53,121 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 18 treesize of output 15 [2018-12-09 04:44:53,123 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 04:44:53,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:44:53,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 04:44:53,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,141 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-09 04:44:53,185 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 45 treesize of output 39 [2018-12-09 04:44:53,186 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 16 treesize of output 15 [2018-12-09 04:44:53,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,199 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-09 04:44:53,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-09 04:44:53,545 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-09 04:44:53,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 8 treesize of output 7 [2018-12-09 04:44:53,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 04:44:53,589 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 44 treesize of output 38 [2018-12-09 04:44:53,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:44:53,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:44:53,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-09 04:44:53,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:53,605 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-09 04:44:53,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:45 [2018-12-09 04:44:54,129 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int) (dll_update_at_~data Int)) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))))) is different from true [2018-12-09 04:44:54,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-12-09 04:44:54,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:44:54,137 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:44:54,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-09 04:44:54,139 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-09 04:44:54,145 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 7 treesize of output 1 [2018-12-09 04:44:54,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:44:54,157 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-09 04:44:54,159 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-09 04:44:54,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,162 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,168 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:17 [2018-12-09 04:44:54,370 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 29 treesize of output 29 [2018-12-09 04:44:54,372 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 15 treesize of output 8 [2018-12-09 04:44:54,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,378 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-09 04:44:54,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:44:54,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2018-12-09 04:44:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 04:44:54,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:44:54,733 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 04:44:54,910 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 04:44:54,915 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 04:44:57,396 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 65 [2018-12-09 04:44:57,399 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 04:44:57,403 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 04:44:59,689 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 04:45:00,549 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-09 04:45:00,590 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-09 04:45:00,592 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-09 04:45:00,603 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 49 treesize of output 43 [2018-12-09 04:45:00,616 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-09 04:45:00,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,627 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 26 treesize of output 24 [2018-12-09 04:45:00,629 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-09 04:45:00,629 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,633 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,635 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-09 04:45:00,637 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-09 04:45:00,637 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,638 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:45:00,682 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-09 04:45:00,685 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-09 04:45:00,703 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 49 treesize of output 43 [2018-12-09 04:45:00,715 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-09 04:45:00,715 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,726 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 26 treesize of output 24 [2018-12-09 04:45:00,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, 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-09 04:45:00,728 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,731 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,733 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-09 04:45:00,735 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-09 04:45:00,735 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,736 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:00,747 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:45:00,772 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-09 04:45:00,772 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:121, output treesize:65 [2018-12-09 04:45:01,057 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 04:45:01,061 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-09 04:45:01,066 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-09 04:45:01,088 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-09 04:45:01,104 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-09 04:45:01,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,121 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-09 04:45:01,123 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-09 04:45:01,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,126 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,132 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-09 04:45:01,134 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-09 04:45:01,134 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 04:45:01,150 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 04:45:01,159 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-09 04:45:01,159 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,164 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:45:01,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-09 04:45:01,260 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-09 04:45:01,277 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-09 04:45:01,278 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,297 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-09 04:45:01,299 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-09 04:45:01,300 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,309 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-09 04:45:01,310 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,321 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-09 04:45:01,321 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-09 04:45:01,325 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:45:01,327 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-09 04:45:01,329 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-09 04:45:01,329 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,333 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,348 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-09 04:45:01,444 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,450 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,451 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,455 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,456 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,459 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:01,460 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-09 04:45:01,465 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-09 04:45:01,466 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:01,473 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:01,474 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:01,479 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:01,561 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-09 04:45:01,561 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 8 variables, input treesize:149, output treesize:300 [2018-12-09 04:45:01,562 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-09 04:45:02,071 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:02,071 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:53, output treesize:4 [2018-12-09 04:45:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:45:02,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:45:02,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 26] total 73 [2018-12-09 04:45:02,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:45:02,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-09 04:45:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-09 04:45:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4858, Unknown=3, NotChecked=140, Total=5256 [2018-12-09 04:45:02,210 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 52 states. [2018-12-09 04:45:08,273 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2018-12-09 04:45:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:12,579 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2018-12-09 04:45:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-09 04:45:12,580 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-09 04:45:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:12,581 INFO L225 Difference]: With dead ends: 169 [2018-12-09 04:45:12,581 INFO L226 Difference]: Without dead ends: 167 [2018-12-09 04:45:12,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=890, Invalid=12666, Unknown=20, NotChecked=230, Total=13806 [2018-12-09 04:45:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-09 04:45:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 79. [2018-12-09 04:45:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 04:45:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2018-12-09 04:45:12,595 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 52 [2018-12-09 04:45:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:12,595 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2018-12-09 04:45:12,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-09 04:45:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2018-12-09 04:45:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:45:12,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:12,596 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-12-09 04:45:12,597 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:12,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1372027452, now seen corresponding path program 1 times [2018-12-09 04:45:12,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:45:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:12,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:12,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:12,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:45:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 04:45:12,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:12,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:45:12,642 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 04:45:12,642 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [24], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-09 04:45:12,643 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:45:12,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:45:12,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:45:12,685 INFO L272 AbstractInterpreter]: Visited 41 different actions 112 times. Merged at 19 different actions 38 times. Never widened. Performed 878 root evaluator evaluations with a maximum evaluation depth of 4. Performed 878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 5 different actions. Largest state had 27 variables. [2018-12-09 04:45:12,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:12,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:45:12,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:12,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:12,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:12,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:45:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:12,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 04:45:12,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 04:45:12,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:45:12,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-09 04:45:12,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:45:12,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:45:12,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:45:12,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:45:12,785 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 5 states. [2018-12-09 04:45:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:12,809 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-12-09 04:45:12,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:45:12,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 04:45:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:12,810 INFO L225 Difference]: With dead ends: 104 [2018-12-09 04:45:12,810 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 04:45:12,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 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-09 04:45:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 04:45:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-12-09 04:45:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 04:45:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2018-12-09 04:45:12,820 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 53 [2018-12-09 04:45:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:12,820 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-12-09 04:45:12,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:45:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-12-09 04:45:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:45:12,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:12,821 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:45:12,821 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:12,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 993490241, now seen corresponding path program 2 times [2018-12-09 04:45:12,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:45:12,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:12,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:12,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:12,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:45:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 04:45:12,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:12,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:45:12,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:45:12,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:45:12,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:12,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:12,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:45:12,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:45:12,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 04:45:12,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:45:12,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:45:12,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:45:12,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:45:12,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-09 04:45:12,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:45:12,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:45:12,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:45:12,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:45:12,987 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 8 states. [2018-12-09 04:45:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:13,044 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2018-12-09 04:45:13,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:45:13,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-09 04:45:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:13,046 INFO L225 Difference]: With dead ends: 142 [2018-12-09 04:45:13,046 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 04:45:13,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 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-09 04:45:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 04:45:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-12-09 04:45:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 04:45:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2018-12-09 04:45:13,055 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 53 [2018-12-09 04:45:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:13,055 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2018-12-09 04:45:13,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:45:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2018-12-09 04:45:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:45:13,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:13,056 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:45:13,056 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:13,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -726983891, now seen corresponding path program 3 times [2018-12-09 04:45:13,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:45:13,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:45:13,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:45:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 04:45:13,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:13,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:45:13,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:45:13,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:45:13,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:13,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:13,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 04:45:13,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 04:45:13,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 04:45:13,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:45:13,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 04:45:13,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 04:45:13,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:45:13,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 04:45:13,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:45:13,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:45:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:45:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:45:13,220 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 8 states. [2018-12-09 04:45:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:13,266 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2018-12-09 04:45:13,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:45:13,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-09 04:45:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:13,267 INFO L225 Difference]: With dead ends: 124 [2018-12-09 04:45:13,267 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 04:45:13,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 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-09 04:45:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 04:45:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-12-09 04:45:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 04:45:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-12-09 04:45:13,277 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 53 [2018-12-09 04:45:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:13,277 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-12-09 04:45:13,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:45:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-12-09 04:45:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:45:13,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:13,278 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-09 04:45:13,278 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:13,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1090802182, now seen corresponding path program 4 times [2018-12-09 04:45:13,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:45:13,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:45:13,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:45:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 04:45:13,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:13,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:45:13,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:45:13,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:45:13,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:13,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:13,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:13,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:45:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:13,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 04:45:13,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 04:45:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:45:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-12-09 04:45:13,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:45:13,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:45:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:45:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-09 04:45:13,426 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 6 states. [2018-12-09 04:45:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:13,456 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-12-09 04:45:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:45:13,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-09 04:45:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:13,457 INFO L225 Difference]: With dead ends: 114 [2018-12-09 04:45:13,457 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 04:45:13,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-09 04:45:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 04:45:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 04:45:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 04:45:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-09 04:45:13,463 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 60 [2018-12-09 04:45:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:13,463 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-09 04:45:13,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:45:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-09 04:45:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 04:45:13,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:13,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:45:13,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:13,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash -554830821, now seen corresponding path program 1 times [2018-12-09 04:45:13,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:45:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:45:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:45:13,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:13,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:45:13,490 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-09 04:45:13,490 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [62], [64], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-09 04:45:13,491 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:45:13,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:45:13,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:45:13,529 INFO L272 AbstractInterpreter]: Visited 42 different actions 104 times. Merged at 18 different actions 35 times. Never widened. Performed 827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 7 different actions. Largest state had 27 variables. [2018-12-09 04:45:13,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:13,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:45:13,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:13,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:13,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:13,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:45:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:13,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:45:13,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:45:13,619 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:45:13,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-09 04:45:13,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:45:13,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:45:13,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:45:13,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:45:13,620 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 6 states. [2018-12-09 04:45:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:13,650 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-12-09 04:45:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:45:13,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 04:45:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:13,651 INFO L225 Difference]: With dead ends: 67 [2018-12-09 04:45:13,651 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 04:45:13,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 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-09 04:45:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 04:45:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 04:45:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 04:45:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-12-09 04:45:13,656 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 62 [2018-12-09 04:45:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:13,656 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-12-09 04:45:13,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:45:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-12-09 04:45:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 04:45:13,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:13,657 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, 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-09 04:45:13,657 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1980808295, now seen corresponding path program 1 times [2018-12-09 04:45:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:45:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:45:13,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:45:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 04:45:14,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:14,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:45:14,162 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-09 04:45:14,162 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [24], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [62], [64], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-09 04:45:14,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:45:14,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:45:14,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:45:14,235 INFO L272 AbstractInterpreter]: Visited 43 different actions 152 times. Merged at 27 different actions 66 times. Never widened. Performed 1118 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 9 different actions. Largest state had 27 variables. [2018-12-09 04:45:14,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:14,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:45:14,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:14,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:14,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:14,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:45:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:14,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:14,297 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-09 04:45:14,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 04:45:14,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:14,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:14,337 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-09 04:45:14,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 04:45:14,378 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 18 treesize of output 15 [2018-12-09 04:45:14,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 04:45:14,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:14,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 04:45:14,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,390 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2018-12-09 04:45:14,419 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 45 treesize of output 39 [2018-12-09 04:45:14,420 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 16 treesize of output 15 [2018-12-09 04:45:14,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,428 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-09 04:45:14,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:35 [2018-12-09 04:45:14,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 04:45:14,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 04:45:14,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:14,655 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-09 04:45:14,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-12-09 04:45:15,239 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))))) is different from true [2018-12-09 04:45:15,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 50 treesize of output 44 [2018-12-09 04:45:15,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:15,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:15,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:15,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 04:45:15,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:15,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:15,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:15,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2018-12-09 04:45:15,444 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-09 04:45:15,446 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-09 04:45:15,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:15,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:15,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:15,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-09 04:45:15,550 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-09 04:45:15,552 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-09 04:45:15,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:15,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:15,573 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 101 treesize of output 87 [2018-12-09 04:45:15,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 27 [2018-12-09 04:45:15,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 04:45:15,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:45:15,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:45:15,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:104 [2018-12-09 04:45:16,363 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 96 treesize of output 90 [2018-12-09 04:45:16,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:16,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:16,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 100 [2018-12-09 04:45:16,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-12-09 04:45:16,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:16,489 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 79 [2018-12-09 04:45:16,490 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-09 04:45:16,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:16,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2018-12-09 04:45:16,552 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-09 04:45:16,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2018-12-09 04:45:16,685 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 64 treesize of output 66 [2018-12-09 04:45:16,687 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 62 treesize of output 58 [2018-12-09 04:45:16,688 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-09 04:45:16,711 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 58 treesize of output 50 [2018-12-09 04:45:16,711 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-09 04:45:16,735 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2018-12-09 04:45:16,736 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 04:45:16,762 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 04:45:16,764 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 52 treesize of output 46 [2018-12-09 04:45:16,766 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 23 treesize of output 15 [2018-12-09 04:45:16,767 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-09 04:45:16,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 04:45:16,774 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-09 04:45:16,780 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:16,785 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 64 treesize of output 66 [2018-12-09 04:45:16,787 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 62 treesize of output 58 [2018-12-09 04:45:16,788 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:16,812 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 58 treesize of output 50 [2018-12-09 04:45:16,813 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-09 04:45:16,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:16,834 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-12-09 04:45:16,834 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:16,852 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 04:45:16,858 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 72 treesize of output 74 [2018-12-09 04:45:16,860 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 70 treesize of output 62 [2018-12-09 04:45:16,860 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:16,883 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 62 treesize of output 58 [2018-12-09 04:45:16,884 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-09 04:45:16,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:16,909 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-12-09 04:45:16,910 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:16,932 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 04:45:16,937 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 48 treesize of output 50 [2018-12-09 04:45:16,939 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 46 treesize of output 38 [2018-12-09 04:45:16,939 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:16,953 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 38 treesize of output 34 [2018-12-09 04:45:16,954 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-09 04:45:16,970 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-09 04:45:16,971 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 04:45:16,989 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 04:45:16,997 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 64 treesize of output 66 [2018-12-09 04:45:17,000 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 62 treesize of output 54 [2018-12-09 04:45:17,000 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:17,020 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 54 treesize of output 50 [2018-12-09 04:45:17,021 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-09 04:45:17,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:17,042 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-12-09 04:45:17,043 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:17,064 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 04:45:17,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-12-09 04:45:17,210 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 48 treesize of output 41 [2018-12-09 04:45:17,211 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,230 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 41 treesize of output 36 [2018-12-09 04:45:17,231 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,250 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 44 treesize of output 32 [2018-12-09 04:45:17,251 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,262 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,269 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 54 treesize of output 56 [2018-12-09 04:45:17,271 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 48 treesize of output 36 [2018-12-09 04:45:17,271 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,294 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,295 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 38 treesize of output 32 [2018-12-09 04:45:17,297 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-09 04:45:17,297 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,301 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,302 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 39 treesize of output 35 [2018-12-09 04:45:17,304 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-09 04:45:17,304 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,309 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-12-09 04:45:17,318 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 39 [2018-12-09 04:45:17,318 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,336 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 39 treesize of output 32 [2018-12-09 04:45:17,336 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,353 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 40 treesize of output 28 [2018-12-09 04:45:17,353 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,368 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-12-09 04:45:17,376 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 44 treesize of output 32 [2018-12-09 04:45:17,376 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,398 INFO L267 ElimStorePlain]: Start of recursive call 43: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,399 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-09 04:45:17,401 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-09 04:45:17,401 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,405 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,410 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-09 04:45:17,411 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 25 [2018-12-09 04:45:17,411 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,425 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 25 treesize of output 20 [2018-12-09 04:45:17,426 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,438 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-09 04:45:17,438 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,445 INFO L267 ElimStorePlain]: Start of recursive call 47: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,446 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 19 [2018-12-09 04:45:17,447 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-09 04:45:17,447 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,450 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,451 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 54 treesize of output 48 [2018-12-09 04:45:17,453 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-09 04:45:17,454 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,459 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,461 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 50 treesize of output 44 [2018-12-09 04:45:17,463 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-09 04:45:17,463 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,468 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-12-09 04:45:17,476 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 39 [2018-12-09 04:45:17,476 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,509 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 40 treesize of output 28 [2018-12-09 04:45:17,509 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,524 INFO L267 ElimStorePlain]: Start of recursive call 57: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,529 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 58 treesize of output 60 [2018-12-09 04:45:17,531 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 56 treesize of output 49 [2018-12-09 04:45:17,531 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,554 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 49 treesize of output 44 [2018-12-09 04:45:17,555 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,578 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 52 treesize of output 40 [2018-12-09 04:45:17,578 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,591 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:17,640 INFO L202 ElimStorePlain]: Needed 63 recursive calls to eliminate 7 variables, input treesize:99, output treesize:7 [2018-12-09 04:45:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-09 04:45:17,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:18,187 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-09 04:45:18,192 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-09 04:45:18,193 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-09 04:45:18,199 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-09 04:45:18,200 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-09 04:45:18,206 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-09 04:45:18,206 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-09 04:45:18,212 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-09 04:45:18,316 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 129 treesize of output 121 [2018-12-09 04:45:18,318 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-09 04:45:18,318 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,323 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,324 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 129 treesize of output 121 [2018-12-09 04:45:18,326 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-09 04:45:18,326 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,331 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,431 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-09 04:45:18,435 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-09 04:45:18,436 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,439 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,440 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,446 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,574 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,577 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,578 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-09 04:45:18,580 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-09 04:45:18,581 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,584 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,645 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-09 04:45:18,651 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-09 04:45:18,652 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:18,657 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:18,657 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:18,665 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:18,666 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:18,671 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:18,749 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-09 04:45:18,753 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-09 04:45:18,753 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,757 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,761 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-09 04:45:18,764 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-09 04:45:18,764 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,766 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,769 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-09 04:45:18,772 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-09 04:45:18,772 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,775 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:18,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 04:45:18,809 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 6 variables, input treesize:281, output treesize:175 [2018-12-09 04:45:19,272 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 04:45:19,574 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:19,575 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-09 04:45:19,579 INFO L168 Benchmark]: Toolchain (without parser) took 29974.03 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 427.8 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -280.8 MB). Peak memory consumption was 147.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:45:19,580 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:45:19,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:45:19,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.73 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-09 04:45:19,580 INFO L168 Benchmark]: Boogie Preprocessor took 18.26 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:45:19,581 INFO L168 Benchmark]: RCFGBuilder took 213.78 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.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:45:19,581 INFO L168 Benchmark]: TraceAbstraction took 29435.72 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.4 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:45:19,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.73 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.26 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 213.78 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.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29435.72 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.4 MB). Peak memory consumption was 155.1 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-09 04:45:20,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:45:20,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:45:20,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:45:20,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:45:20,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:45:20,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:45:20,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:45:20,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:45:20,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:45:20,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:45:20,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:45:20,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:45:20,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:45:20,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:45:20,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:45:20,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:45:20,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:45:20,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:45:20,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:45:20,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:45:20,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:45:20,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:45:20,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:45:20,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:45:20,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:45:20,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:45:20,816 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:45:20,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:45:20,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:45:20,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:45:20,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:45:20,817 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:45:20,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:45:20,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:45:20,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:45:20,818 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 04:45:20,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:45:20,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:45:20,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:45:20,829 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:45:20,829 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:45:20,829 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:45:20,829 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:45:20,829 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:45:20,830 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:45:20,830 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:45:20,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:45:20,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:45:20,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:45:20,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:45:20,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:45:20,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:45:20,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:45:20,831 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 04:45:20,832 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 04:45:20,832 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:45:20,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:45:20,832 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:45:20,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:45:20,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:45:20,833 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:45:20,833 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:45:20,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:45:20,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:45:20,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:45:20,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:45:20,833 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:45:20,834 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 04:45:20,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:45:20,834 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 04:45:20,834 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 04:45:20,834 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_0a21b925-ab75-4667-8dc5-d62e387b67ee/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 -> fabf658906da38258bbb10e77b5550f740cea929 [2018-12-09 04:45:20,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:45:20,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:45:20,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:45:20,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:45:20,868 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:45:20,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:45:20,906 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/a004bae07/a55f124a70a84df5a47ffb9e39c1878b/FLAGb50702c96 [2018-12-09 04:45:21,281 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:45:21,281 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:45:21,288 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/a004bae07/a55f124a70a84df5a47ffb9e39c1878b/FLAGb50702c96 [2018-12-09 04:45:21,299 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/data/a004bae07/a55f124a70a84df5a47ffb9e39c1878b [2018-12-09 04:45:21,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:45:21,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:45:21,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:45:21,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:45:21,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:45:21,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21, skipping insertion in model container [2018-12-09 04:45:21,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:45:21,336 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:45:21,493 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:45:21,501 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:45:21,559 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:45:21,581 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:45:21,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21 WrapperNode [2018-12-09 04:45:21,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:45:21,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:45:21,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:45:21,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:45:21,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:45:21,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:45:21,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:45:21,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:45:21,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... [2018-12-09 04:45:21,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:45:21,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:45:21,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:45:21,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:45:21,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:45:21,652 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 04:45:21,653 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 04:45:21,653 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 04:45:21,653 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 04:45:21,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:45:21,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 04:45:21,653 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-09 04:45:21,653 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-09 04:45:21,653 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-09 04:45:21,653 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-09 04:45:21,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 04:45:21,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 04:45:21,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 04:45:21,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 04:45:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 04:45:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 04:45:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:45:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 04:45:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 04:45:21,654 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 04:45:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:45:21,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:45:21,917 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:45:21,917 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 04:45:21,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:45:21 BoogieIcfgContainer [2018-12-09 04:45:21,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:45:21,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:45:21,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:45:21,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:45:21,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:45:21" (1/3) ... [2018-12-09 04:45:21,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc98e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:45:21, skipping insertion in model container [2018-12-09 04:45:21,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:21" (2/3) ... [2018-12-09 04:45:21,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc98e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:45:21, skipping insertion in model container [2018-12-09 04:45:21,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:45:21" (3/3) ... [2018-12-09 04:45:21,924 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 04:45:21,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:45:21,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 04:45:21,942 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 04:45:21,958 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:45:21,959 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:45:21,959 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:45:21,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:45:21,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:45:21,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:45:21,959 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:45:21,959 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:45:21,959 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:45:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 04:45:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 04:45:21,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:21,972 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-09 04:45:21,973 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:21,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 493292703, now seen corresponding path program 1 times [2018-12-09 04:45:21,979 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:45:21,979 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:45:21,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:22,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:45:22,081 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 04:45:22,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:45:22,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:45:22,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:45:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:45:22,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:45:22,095 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-12-09 04:45:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:22,181 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-12-09 04:45:22,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:45:22,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-09 04:45:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:22,188 INFO L225 Difference]: With dead ends: 93 [2018-12-09 04:45:22,188 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 04:45:22,191 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-09 04:45:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 04:45:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-12-09 04:45:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 04:45:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-09 04:45:22,217 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-12-09 04:45:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:22,217 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-09 04:45:22,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:45:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-09 04:45:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 04:45:22,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:22,218 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] [2018-12-09 04:45:22,218 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:22,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1903143933, now seen corresponding path program 1 times [2018-12-09 04:45:22,219 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:45:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:45:22,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:22,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:45:22,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 04:45:22,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:45:22,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:45:22,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:45:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:45:22,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:45:22,274 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2018-12-09 04:45:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:22,550 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-12-09 04:45:22,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:45:22,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 04:45:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:22,551 INFO L225 Difference]: With dead ends: 71 [2018-12-09 04:45:22,552 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 04:45:22,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:45:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 04:45:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-09 04:45:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 04:45:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-09 04:45:22,557 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-12-09 04:45:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:22,557 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-09 04:45:22,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:45:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-09 04:45:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 04:45:22,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:22,558 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] [2018-12-09 04:45:22,558 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:22,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash 397678657, now seen corresponding path program 1 times [2018-12-09 04:45:22,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:45:22,558 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 04:45:22,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:22,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:45:22,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:45:22,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:22,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:22,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:22,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:45:22,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 04:45:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:45:22,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 10 [2018-12-09 04:45:22,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 04:45:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 04:45:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:45:22,852 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 10 states. [2018-12-09 04:45:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:23,016 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-12-09 04:45:23,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:45:23,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-12-09 04:45:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:23,018 INFO L225 Difference]: With dead ends: 80 [2018-12-09 04:45:23,018 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 04:45:23,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:45:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 04:45:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-12-09 04:45:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 04:45:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 04:45:23,025 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2018-12-09 04:45:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:23,025 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 04:45:23,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 04:45:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 04:45:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 04:45:23,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:23,026 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 04:45:23,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:23,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash -972894633, now seen corresponding path program 1 times [2018-12-09 04:45:23,027 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:45:23,027 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:45:23,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:23,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 04:45:23,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 04:45:23,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:23,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:23,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:23,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:23,234 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-09 04:45:23,237 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-09 04:45:23,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 04:45:23,425 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-09 04:45:23,429 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-09 04:45:23,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,452 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-09 04:45:23,452 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,475 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-09 04:45:23,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,486 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-09 04:45:23,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:31, output treesize:7 [2018-12-09 04:45:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 04:45:23,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:23,890 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-09 04:45:23,893 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-09 04:45:23,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:23,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:45:23,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-12-09 04:45:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 04:45:23,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 04:45:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14, 12] total 26 [2018-12-09 04:45:23,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 04:45:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 04:45:23,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-12-09 04:45:23,952 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 26 states. [2018-12-09 04:45:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:31,556 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-12-09 04:45:31,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 04:45:31,557 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-12-09 04:45:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:31,559 INFO L225 Difference]: With dead ends: 89 [2018-12-09 04:45:31,559 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 04:45:31,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 04:45:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 04:45:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2018-12-09 04:45:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 04:45:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-09 04:45:31,565 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-12-09 04:45:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:31,565 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-09 04:45:31,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 04:45:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-09 04:45:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 04:45:31,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:31,567 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:45:31,567 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:31,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1308182797, now seen corresponding path program 2 times [2018-12-09 04:45:31,567 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:45:31,567 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:45:31,580 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 04:45:31,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:45:31,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:45:31,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:45:31,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:45:31,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:31,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:31,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:45:31,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:45:31,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:45:31,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:45:31,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:45:31,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 04:45:31,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 04:45:31,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:45:31,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:45:31,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:45:31,837 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 9 states. [2018-12-09 04:45:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:45:31,955 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2018-12-09 04:45:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:45:31,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-09 04:45:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:45:31,957 INFO L225 Difference]: With dead ends: 92 [2018-12-09 04:45:31,957 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 04:45:31,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 191 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-09 04:45:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 04:45:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-12-09 04:45:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 04:45:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-12-09 04:45:31,962 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 50 [2018-12-09 04:45:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:45:31,962 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-12-09 04:45:31,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:45:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-09 04:45:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 04:45:31,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:45:31,963 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:45:31,963 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:45:31,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:45:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 504923514, now seen corresponding path program 1 times [2018-12-09 04:45:31,964 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:45:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:45:31,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:45:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:32,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:32,112 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-09 04:45:32,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 04:45:32,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:32,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:32,125 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-09 04:45:32,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 04:45:32,148 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 18 treesize of output 15 [2018-12-09 04:45:32,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 04:45:32,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:32,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 04:45:32,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,175 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-09 04:45:32,210 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 45 treesize of output 39 [2018-12-09 04:45:32,212 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 16 treesize of output 15 [2018-12-09 04:45:32,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,234 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-09 04:45:32,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-09 04:45:32,607 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-09 04:45:32,610 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-09 04:45:32,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 04:45:32,688 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 50 treesize of output 44 [2018-12-09 04:45:32,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:32,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:32,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:32,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 04:45:32,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:32,731 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-09 04:45:32,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:50 [2018-12-09 04:45:34,562 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (bvadd |c_dll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-09 04:45:34,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-12-09 04:45:34,576 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 7 treesize of output 1 [2018-12-09 04:45:34,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:34,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:34,592 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-09 04:45:34,593 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-09 04:45:34,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:34,629 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-09 04:45:34,631 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-09 04:45:34,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:34,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:34,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:34,648 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-12-09 04:45:37,005 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-09 04:45:37,008 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-09 04:45:37,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:37,021 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-09 04:45:37,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:37,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:37,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:37,030 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-12-09 04:45:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 04:45:37,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:39,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:45:39,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:45:39,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:45:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:45:39,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:45:39,744 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-09 04:45:39,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 04:45:39,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:39,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:39,751 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-09 04:45:39,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 04:45:39,760 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 18 treesize of output 15 [2018-12-09 04:45:39,763 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 04:45:39,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:39,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 04:45:39,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,786 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-09 04:45:39,798 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 45 treesize of output 39 [2018-12-09 04:45:39,801 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 16 treesize of output 15 [2018-12-09 04:45:39,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,824 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-09 04:45:39,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-09 04:45:39,897 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-09 04:45:39,899 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-09 04:45:39,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 04:45:39,924 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 50 treesize of output 44 [2018-12-09 04:45:39,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:39,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:39,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:39,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 04:45:39,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:39,982 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-09 04:45:39,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:50 [2018-12-09 04:45:40,002 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-09 04:45:40,005 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-09 04:45:40,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:40,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:40,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-12-09 04:45:40,056 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 7 treesize of output 1 [2018-12-09 04:45:40,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:40,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:45:40,068 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 04:45:40,069 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:40,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:45:40,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:40,088 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-12-09 04:45:42,171 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-09 04:45:42,174 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-09 04:45:42,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:42,188 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-09 04:45:42,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:45:42,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:42,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:45:42,198 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-12-09 04:45:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 04:45:42,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:45:44,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:45:44,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-12-09 04:45:44,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 04:45:44,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 04:45:44,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1027, Unknown=3, NotChecked=64, Total=1190 [2018-12-09 04:45:44,567 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 28 states. [2018-12-09 04:46:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:01,759 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-12-09 04:46:01,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-09 04:46:01,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-09 04:46:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:01,761 INFO L225 Difference]: With dead ends: 118 [2018-12-09 04:46:01,762 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 04:46:01,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=282, Invalid=2911, Unknown=3, NotChecked=110, Total=3306 [2018-12-09 04:46:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 04:46:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-12-09 04:46:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 04:46:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-12-09 04:46:01,777 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 51 [2018-12-09 04:46:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:01,777 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-12-09 04:46:01,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 04:46:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-12-09 04:46:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 04:46:01,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:46:01,779 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:46:01,779 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:46:01,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:46:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash -339081988, now seen corresponding path program 1 times [2018-12-09 04:46:01,779 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:46:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:01,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:46:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:46:01,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:46:01,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:46:01,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:46:01,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:46:01,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:46:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:46:01,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:46:01,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:46:01,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 04:46:01,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-12-09 04:46:01,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:46:01,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:46:01,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:46:01,901 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 4 states. [2018-12-09 04:46:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:02,101 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2018-12-09 04:46:02,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:46:02,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 04:46:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:02,102 INFO L225 Difference]: With dead ends: 156 [2018-12-09 04:46:02,102 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 04:46:02,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:46:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 04:46:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-09 04:46:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 04:46:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2018-12-09 04:46:02,111 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 51 [2018-12-09 04:46:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:02,111 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2018-12-09 04:46:02,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:46:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-12-09 04:46:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:46:02,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:46:02,112 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-09 04:46:02,112 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:46:02,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:46:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash 72098954, now seen corresponding path program 1 times [2018-12-09 04:46:02,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:46:02,113 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 04:46:02,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:46:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:46:02,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 04:46:02,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 04:46:02,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:46:02,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-09 04:46:02,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:46:02,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:46:02,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:46:02,252 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 7 states. [2018-12-09 04:46:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:02,303 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2018-12-09 04:46:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:46:02,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-09 04:46:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:02,304 INFO L225 Difference]: With dead ends: 115 [2018-12-09 04:46:02,304 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 04:46:02,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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-09 04:46:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 04:46:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-12-09 04:46:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 04:46:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-12-09 04:46:02,314 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 52 [2018-12-09 04:46:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:02,314 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-12-09 04:46:02,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:46:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-12-09 04:46:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:46:02,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:46:02,315 INFO L402 BasicCegarLoop]: trace histogram [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-09 04:46:02,316 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:46:02,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:46:02,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1373689517, now seen corresponding path program 2 times [2018-12-09 04:46:02,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:46:02,316 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:02,329 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 04:46:02,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:46:02,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:46:02,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:46:02,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:46:02,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:46:02,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:46:02,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:46:02,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:46:02,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:46:02,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 04:46:03,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 04:46:03,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 04:46:03,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 04:46:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 04:46:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-09 04:46:03,010 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 18 states. [2018-12-09 04:46:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:03,889 INFO L93 Difference]: Finished difference Result 165 states and 210 transitions. [2018-12-09 04:46:03,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 04:46:03,891 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-09 04:46:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:03,891 INFO L225 Difference]: With dead ends: 165 [2018-12-09 04:46:03,892 INFO L226 Difference]: Without dead ends: 131 [2018-12-09 04:46:03,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-09 04:46:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-09 04:46:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2018-12-09 04:46:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 04:46:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2018-12-09 04:46:03,904 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 52 [2018-12-09 04:46:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:03,904 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2018-12-09 04:46:03,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 04:46:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-12-09 04:46:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:46:03,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:46:03,905 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-09 04:46:03,905 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:46:03,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:46:03,905 INFO L82 PathProgramCache]: Analyzing trace with hash 460074888, now seen corresponding path program 1 times [2018-12-09 04:46:03,905 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:46:03,905 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:03,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:46:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:46:04,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:04,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:04,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:46:04,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:04,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:46:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:46:04,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:04,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:04,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 04:46:04,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 04:46:04,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:46:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:46:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:46:04,153 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 9 states. [2018-12-09 04:46:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:04,266 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-12-09 04:46:04,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:46:04,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-09 04:46:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:04,267 INFO L225 Difference]: With dead ends: 142 [2018-12-09 04:46:04,268 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 04:46:04,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 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-09 04:46:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 04:46:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-12-09 04:46:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 04:46:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-12-09 04:46:04,282 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 60 [2018-12-09 04:46:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:04,282 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-12-09 04:46:04,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:46:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-12-09 04:46:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:46:04,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:46:04,283 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-09 04:46:04,283 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:46:04,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:46:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash -208984649, now seen corresponding path program 3 times [2018-12-09 04:46:04,283 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:46:04,283 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:04,297 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 04:46:04,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 04:46:04,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:46:04,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 04:46:04,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:04,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:46:04,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:04,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:46:13,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 04:46:13,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:46:13,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 04:46:13,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:46:13,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:46:13,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 20 [2018-12-09 04:46:13,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 04:46:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 04:46:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-12-09 04:46:13,756 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 20 states. [2018-12-09 04:46:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:13,973 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-09 04:46:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 04:46:13,973 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-09 04:46:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:13,973 INFO L225 Difference]: With dead ends: 123 [2018-12-09 04:46:13,973 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 04:46:13,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-12-09 04:46:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 04:46:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-09 04:46:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 04:46:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-09 04:46:13,980 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 60 [2018-12-09 04:46:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:13,980 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-09 04:46:13,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 04:46:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-09 04:46:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 04:46:13,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:46:13,981 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-12-09 04:46:13,981 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:46:13,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:46:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1318208452, now seen corresponding path program 1 times [2018-12-09 04:46:13,981 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:46:13,981 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:13,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:46:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:46:14,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:14,171 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-09 04:46:14,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 04:46:14,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:14,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:14,190 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-09 04:46:14,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-09 04:46:14,209 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 18 treesize of output 15 [2018-12-09 04:46:14,211 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 15 treesize of output 18 [2018-12-09 04:46:14,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:14,214 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:46:14,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-09 04:46:14,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,220 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2018-12-09 04:46:14,264 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 30 treesize of output 31 [2018-12-09 04:46:14,267 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-09 04:46:14,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,286 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-09 04:46:14,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 04:46:14,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 04:46:14,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 04:46:14,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-09 04:46:14,577 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 37 treesize of output 34 [2018-12-09 04:46:14,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:14,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:14,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 04:46:14,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,612 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-09 04:46:14,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-12-09 04:46:14,871 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-09 04:46:14,876 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-09 04:46:14,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:14,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-09 04:46:15,107 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 113 [2018-12-09 04:46:15,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:15,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 119 [2018-12-09 04:46:15,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:15,184 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 105 treesize of output 69 [2018-12-09 04:46:15,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:15,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:15,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 131 [2018-12-09 04:46:15,347 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 105 treesize of output 69 [2018-12-09 04:46:15,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:15,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:15,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:46:15,511 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:147, output treesize:57 [2018-12-09 04:46:17,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:17,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 199 [2018-12-09 04:46:17,456 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 106 [2018-12-09 04:46:17,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:20,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 72 treesize of output 57 [2018-12-09 04:46:20,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:21,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 50 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:21,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 80 [2018-12-09 04:46:21,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 32 xjuncts. [2018-12-09 04:46:21,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2018-12-09 04:46:21,676 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 17 treesize of output 13 [2018-12-09 04:46:21,676 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:21,736 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 17 treesize of output 13 [2018-12-09 04:46:21,737 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:21,752 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-09 04:46:21,753 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:21,759 INFO L267 ElimStorePlain]: Start of recursive call 6: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:21,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:21,764 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:158, output treesize:9 [2018-12-09 04:46:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:46:21,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:23,915 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 04:46:24,045 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 04:46:24,203 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 04:46:24,205 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-09 04:46:24,225 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-09 04:46:24,226 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-09 04:46:24,248 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-09 04:46:24,249 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-09 04:46:24,275 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-09 04:46:24,275 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-09 04:46:24,294 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-09 04:46:24,535 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-09 04:46:24,551 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-09 04:46:24,552 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-09 04:46:24,573 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-09 04:46:24,574 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-09 04:46:24,592 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-09 04:46:24,593 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-09 04:46:24,609 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-09 04:46:25,015 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 132 treesize of output 136 [2018-12-09 04:46:25,034 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 96 [2018-12-09 04:46:25,035 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-09 04:46:25,062 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,065 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 107 treesize of output 105 [2018-12-09 04:46:25,068 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-09 04:46:25,068 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,083 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,087 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:46:25,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 96 treesize of output 95 [2018-12-09 04:46:25,094 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-09 04:46:25,094 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,119 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-09 04:46:25,119 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,127 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,128 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 04:46:25,128 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,129 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 04:46:25,130 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,137 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:46:25,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 131 [2018-12-09 04:46:25,148 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-09 04:46:25,148 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,175 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-09 04:46:25,175 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,179 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,182 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 103 treesize of output 69 [2018-12-09 04:46:25,185 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-09 04:46:25,185 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,196 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,197 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 04:46:25,198 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,227 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 96 treesize of output 100 [2018-12-09 04:46:25,233 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 95 treesize of output 89 [2018-12-09 04:46:25,233 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,291 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 89 treesize of output 55 [2018-12-09 04:46:25,291 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,370 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 1 case distinctions, treesize of input 60 treesize of output 60 [2018-12-09 04:46:25,370 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-12-09 04:46:25,394 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,399 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 107 treesize of output 105 [2018-12-09 04:46:25,404 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-09 04:46:25,404 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,433 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,434 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 04:46:25,434 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-12-09 04:46:25,518 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 3 variables, input treesize:174, output treesize:117 [2018-12-09 04:46:25,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:46:25,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/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-09 04:46:25,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:46:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:46:25,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:25,801 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-09 04:46:25,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 04:46:25,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:25,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:25,980 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-09 04:46:25,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:25,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 04:46:26,086 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 18 treesize of output 15 [2018-12-09 04:46:26,088 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 04:46:26,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:26,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 04:46:26,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:26,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:26,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:26,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:26,114 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-09 04:46:26,253 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 45 treesize of output 39 [2018-12-09 04:46:26,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 16 treesize of output 15 [2018-12-09 04:46:26,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:26,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:26,277 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-09 04:46:26,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-09 04:46:27,643 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 50 treesize of output 44 [2018-12-09 04:46:27,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:27,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:27,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:27,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 04:46:27,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:27,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:27,685 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-09 04:46:27,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-12-09 04:46:28,529 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-09 04:46:28,534 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-09 04:46:28,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:28,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:28,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:28,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:113 [2018-12-09 04:46:28,937 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-09 04:46:28,942 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-09 04:46:28,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:28,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:29,008 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 103 treesize of output 89 [2018-12-09 04:46:29,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 27 [2018-12-09 04:46:29,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 04:46:29,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:46:29,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:29,148 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:165, output treesize:118 [2018-12-09 04:46:31,604 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 48 treesize of output 46 [2018-12-09 04:46:31,609 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-09 04:46:31,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:31,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:31,662 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-09 04:46:31,666 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 04:46:31,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:31,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-09 04:46:31,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:31,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:31,689 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-09 04:46:31,689 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:88, output treesize:9 [2018-12-09 04:46:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:46:31,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:33,615 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 04:46:33,884 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 04:46:34,048 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 04:46:34,157 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 04:46:34,158 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-09 04:46:34,185 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-09 04:46:34,186 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-09 04:46:34,207 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-09 04:46:34,208 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-09 04:46:34,229 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-09 04:46:34,230 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-09 04:46:34,248 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-09 04:46:34,419 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-09 04:46:34,438 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-09 04:46:34,439 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-09 04:46:34,456 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-09 04:46:34,457 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-09 04:46:34,479 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-09 04:46:34,479 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-09 04:46:34,503 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-09 04:46:34,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:34,702 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:46:34,702 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 115 treesize of output 97 [2018-12-09 04:46:34,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:34,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 87 treesize of output 76 [2018-12-09 04:46:34,718 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:34,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2018-12-09 04:46:34,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2018-12-09 04:46:34,747 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:34,758 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:34,774 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:34,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 110 [2018-12-09 04:46:34,839 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 78 treesize of output 77 [2018-12-09 04:46:34,839 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:34,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 78 [2018-12-09 04:46:34,969 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 25 [2018-12-09 04:46:35,059 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 10 treesize of output 6 [2018-12-09 04:46:35,059 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:46:35,077 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-09 04:46:35,077 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,087 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,183 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 68 treesize of output 70 [2018-12-09 04:46:35,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-12-09 04:46:35,187 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,275 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-12-09 04:46:35,276 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:35,324 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:35,413 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 71 treesize of output 71 [2018-12-09 04:46:35,444 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-12-09 04:46:35,445 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:35,522 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:35,570 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 04:46:35,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:35,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 114 [2018-12-09 04:46:35,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:35,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 104 treesize of output 97 [2018-12-09 04:46:35,602 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:46:35,626 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-12-09 04:46:35,629 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 50 treesize of output 37 [2018-12-09 04:46:35,630 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,638 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,650 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:35,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 101 [2018-12-09 04:46:35,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 80 treesize of output 98 [2018-12-09 04:46:35,764 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-09 04:46:35,913 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 83 treesize of output 82 [2018-12-09 04:46:35,914 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:36,088 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 76 treesize of output 74 [2018-12-09 04:46:36,120 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2018-12-09 04:46:36,121 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:36,196 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 58 treesize of output 50 [2018-12-09 04:46:36,196 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:46:36,270 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 04:46:36,517 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 69 [2018-12-09 04:46:36,537 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2018-12-09 04:46:36,537 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:36,606 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 04:46:36,610 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-09 04:46:36,614 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 50 treesize of output 37 [2018-12-09 04:46:36,615 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:36,632 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:36,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 82 treesize of output 68 [2018-12-09 04:46:36,949 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 1 [2018-12-09 04:46:36,950 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:36,970 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 43 treesize of output 35 [2018-12-09 04:46:36,970 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:46:36,987 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:46:37,311 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 04:46:37,862 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 41 treesize of output 13 [2018-12-09 04:46:37,864 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 7 treesize of output 5 [2018-12-09 04:46:37,865 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,867 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,871 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 46 treesize of output 18 [2018-12-09 04:46:37,874 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 7 treesize of output 5 [2018-12-09 04:46:37,875 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,883 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,887 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 43 treesize of output 13 [2018-12-09 04:46:37,889 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 7 treesize of output 5 [2018-12-09 04:46:37,889 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,892 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2018-12-09 04:46:37,897 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 7 treesize of output 5 [2018-12-09 04:46:37,898 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,905 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,908 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 75 treesize of output 45 [2018-12-09 04:46:37,912 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 7 treesize of output 5 [2018-12-09 04:46:37,912 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,915 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,919 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 46 treesize of output 18 [2018-12-09 04:46:37,922 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 7 treesize of output 5 [2018-12-09 04:46:37,922 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,931 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:46:37,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 04:46:37,978 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 4 variables, input treesize:148, output treesize:80 [2018-12-09 04:46:38,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:46:38,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 61 [2018-12-09 04:46:38,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-09 04:46:38,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-09 04:46:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=6422, Unknown=6, NotChecked=0, Total=6806 [2018-12-09 04:46:38,338 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 61 states. [2018-12-09 04:46:43,195 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-12-09 04:46:44,005 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-09 04:46:49,432 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 04:46:53,510 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-09 04:46:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:54,007 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-12-09 04:46:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-09 04:46:54,008 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-09 04:46:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:54,008 INFO L225 Difference]: With dead ends: 76 [2018-12-09 04:46:54,008 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 04:46:54,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4043 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=905, Invalid=12428, Unknown=7, NotChecked=0, Total=13340 [2018-12-09 04:46:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 04:46:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-09 04:46:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 04:46:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-09 04:46:54,017 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 61 [2018-12-09 04:46:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:54,017 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-09 04:46:54,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-09 04:46:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-09 04:46:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 04:46:54,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:46:54,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:46:54,018 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:46:54,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:46:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash -610417144, now seen corresponding path program 2 times [2018-12-09 04:46:54,018 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 04:46:54,019 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 04:46:54,035 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 04:46:54,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:46:54,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:46:54,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:54,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:54,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:46:54,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a21b925-ab75-4667-8dc5-d62e387b67ee/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:46:54,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:46:54,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:46:54,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:46:54,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:46:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:54,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:46:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 04:46:54,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 04:46:54,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 04:46:54,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 04:46:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 04:46:54,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-09 04:46:54,733 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 18 states. [2018-12-09 04:46:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:46:55,300 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-09 04:46:55,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:46:55,301 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-12-09 04:46:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:46:55,301 INFO L225 Difference]: With dead ends: 67 [2018-12-09 04:46:55,301 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 04:46:55,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 229 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-09 04:46:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 04:46:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 04:46:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 04:46:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 04:46:55,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-12-09 04:46:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:46:55,302 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:46:55,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 04:46:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:46:55,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 04:46:55,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 04:46:55,849 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-12-09 04:46:56,212 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2018-12-09 04:46:56,727 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-09 04:46:56,944 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-12-09 04:46:57,674 WARN L180 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 106 [2018-12-09 04:46:57,924 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-12-09 04:46:58,328 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-12-09 04:46:58,330 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse5 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse0 (and .cse1 .cse2 (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) .cse4 .cse5 (= dll_update_at_~index |dll_update_at_#in~index|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base)))) (and (or .cse0 (bvsgt (bvadd |dll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse3 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (and .cse1 .cse2 (= dll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse3)) .cse4 .cse5 (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse3) dll_update_at_~head.base) (= (bvadd dll_update_at_~index (_ bv1 32)) |dll_update_at_#in~index|))) (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 .cse0 (bvsgt |dll_update_at_#in~index| (_ bv0 32)))))) [2018-12-09 04:46:58,330 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-12-09 04:46:58,330 INFO L444 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) 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 (bvsgt |dll_update_at_#in~index| (_ bv0 32)) .cse0) (or .cse0 (bvsgt (bvadd |dll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (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)))))))) [2018-12-09 04:46:58,330 INFO L448 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2018-12-09 04:46:58,330 INFO L448 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2018-12-09 04:46:58,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 04:46:58,330 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 04:46:58,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 04:46:58,330 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-12-09 04:46:58,330 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-12-09 04:46:58,330 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-12-09 04:46:58,330 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L444 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 04:46:58,331 INFO L444 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse14 (= (_ bv0 32) dll_create_~head~0.base))) (let ((.cse1 (= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))) (.cse4 (not (= dll_create_~new_head~0.base (_ bv0 32)))) (.cse0 (= (_ bv0 32) dll_create_~new_head~0.offset)) (.cse2 (= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))) (.cse5 (not .cse14)) (.cse3 (= (_ bv0 32) dll_create_~head~0.offset))) (or (and .cse0 (= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse8 (bvadd dll_create_~new_head~0.offset (_ bv8 32))) (.cse11 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse7 (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (.cse9 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse13 (bvadd dll_create_~head~0.offset (_ bv8 32))) (.cse12 (select |#memory_$Pointer$.offset| dll_create_~head~0.base)) (.cse10 (bvadd dll_create_~head~0.offset (_ bv4 32)))) (and (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (= (select .cse6 .cse7) (_ bv0 32)) .cse1 .cse4 (= (_ bv0 32) (select .cse6 .cse8)) (not (= (select .cse9 .cse10) dll_create_~head~0.base)) (= (_ bv0 32) (select .cse11 .cse8)) .cse0 (= (select .cse12 .cse13) (_ bv0 32)) (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= dll_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select .cse11 .cse7))) .cse2 (= (_ bv0 32) (select .cse9 .cse13)) .cse3 .cse5 (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (= (select .cse12 .cse10) (_ bv0 32)))) (and (= |old(#memory_int)| |#memory_int|) .cse14 .cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_create_~len |dll_create_#in~len|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L451 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 04:46:58,331 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 04:46:58,331 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 04:46:58,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 04:46:58,332 INFO L444 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse1 (forall ((v_main_~s~0.base_BEFORE_CALL_20 (_ BitVec 32))) (let ((.cse10 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_20))) (let ((.cse9 (select .cse10 (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_20) (_ bv4 32))))) (= .cse9 v_main_~s~0.base_BEFORE_CALL_20) (not (= (select .cse10 (_ bv8 32)) (_ bv0 32)))))))) (.cse2 (forall ((v_subst_3 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse8 (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14))) (let ((.cse7 (select .cse8 (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32))) .cse7))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))) (not (= (select .cse8 (_ bv8 32)) (_ bv0 32))) (not (= (_ bv0 32) .cse7)) (= v_main_~s~0.base_BEFORE_CALL_14 v_subst_3)))))) (.cse0 (and (= |dll_get_data_at_#in~index| dll_get_data_at_~index) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base)))) (and (or .cse0 .cse1 .cse2 (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))))) (bvsgt |dll_get_data_at_#in~index| (_ bv0 32))) (or .cse1 (bvsgt (bvadd |dll_get_data_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) .cse2 (forall ((v_main_~s~0.base_BEFORE_CALL_15 (_ BitVec 32))) (let ((.cse5 (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_15))) (let ((.cse3 (select .cse5 (_ bv4 32))) (.cse4 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_15) (_ bv0 32)))) (or (not (= (_ bv0 32) .cse3)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_15) (_ bv4 32))) .cse3) (_ bv4294967295 32)) (bvneg (bvneg .cse4)))) (not (= (bvadd .cse4 (_ bv4294967294 32)) (_ bv0 32))) (not (= (select .cse5 (_ bv8 32)) (_ bv0 32))))))) (let ((.cse6 (bvadd |dll_get_data_at_#in~head.offset| (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.base| |dll_get_data_at_#in~head.base|) .cse6) dll_get_data_at_~head.base) (= (bvadd dll_get_data_at_~index (_ bv1 32)) |dll_get_data_at_#in~index|) (= dll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_get_data_at_#in~head.base|) .cse6)))) .cse0))) [2018-12-09 04:46:58,332 INFO L448 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2018-12-09 04:46:58,332 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2018-12-09 04:46:58,332 INFO L451 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2018-12-09 04:46:58,332 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2018-12-09 04:46:58,332 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2018-12-09 04:46:58,332 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-12-09 04:46:58,332 INFO L444 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse11 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse10 (bvadd (let ((.cse14 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_int| (select .cse12 .cse14)) (select .cse11 .cse14))) (_ bv4294967295 32))) (.cse13 (bvneg main_~len~0))) (let ((.cse0 (= (select .cse11 (_ bv8 32)) (_ bv0 32))) (.cse5 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= .cse10 (bvneg .cse13))) (.cse6 (= (bvadd .cse13 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse7 (= (_ bv0 32) (select .cse12 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse8 (= (select .cse11 (_ bv4 32)) (_ bv0 32))) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (= main_~len~0 .cse1) .cse2 (and .cse3 (= main_~i~0 (_ bv0 32))) .cse4 .cse5 .cse6 (= (bvadd main_~len~0 main_~i~0) main_~expected~0) .cse7 .cse8) (let ((.cse9 (bvneg .cse1))) (and .cse0 .cse5 .cse3 .cse2 (= (_ bv1 32) (bvadd .cse9 main_~expected~0)) .cse6 .cse4 (= .cse10 (bvneg .cse9)) .cse7 .cse8 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))))) [2018-12-09 04:46:58,332 INFO L448 ceAbstractionStarter]: For program point L624-1(lines 624 626) no Hoare annotation was computed. [2018-12-09 04:46:58,332 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2018-12-09 04:46:58,333 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2018-12-09 04:46:58,333 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse8 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse1 (= (select .cse8 (_ bv8 32)) (_ bv0 32))) (.cse2 (not (= (select .cse9 (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base))) (.cse4 (= main_~s~0.offset (_ bv0 32))) (.cse3 (exists ((v_subst_4 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_4 (_ bv8 32))) main_~s~0.base))) (.cse0 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse5 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse6 (= (_ bv0 32) (select .cse9 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse7 (= (select .cse8 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (bvadd (bvneg main_~len~0) main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5 .cse6 .cse7 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse2 (= main_~len~0 main_~new_data~0) .cse4 .cse3 (= main_~i~0 (_ bv0 32)) .cse0 .cse5 .cse6 .cse7)))) [2018-12-09 04:46:58,333 INFO L448 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2018-12-09 04:46:58,333 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2018-12-09 04:46:58,333 INFO L444 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse15 (bvsgt main_~i~0 (_ bv0 32))) (.cse4 (= main_~i~0 (_ bv0 32)))) (let ((.cse12 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse13 (bvneg main_~len~0)) (.cse11 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse2 (let ((.cse16 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse15 .cse16) (and .cse16 .cse4)))) (.cse3 (= main_~s~0.offset (_ bv0 32))) (.cse5 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (let ((.cse0 (and .cse15 (and .cse2 .cse3 .cse5))) (.cse1 (= (select .cse11 (_ bv8 32)) (_ bv0 32))) (.cse6 (= (bvadd (let ((.cse14 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_int| (select .cse12 .cse14)) (select .cse11 .cse14))) (_ bv4294967295 32)) (bvneg .cse13))) (.cse7 (= (bvadd .cse13 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse8 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse9 (= (_ bv0 32) (select .cse12 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse10 (= (select .cse11 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-09 04:46:58,333 INFO L444 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-09 04:46:58,333 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |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-09 04:46:58,333 INFO L444 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse11 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse10 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse9 (select .cse13 .cse11))) (let ((.cse1 (not (= .cse9 main_~s~0.base))) (.cse3 (exists ((v_subst_4 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_4 (_ bv8 32))) main_~s~0.base))) (.cse0 (= (select .cse10 (_ bv8 32)) (_ bv0 32))) (.cse4 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse8 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse5 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse2 (= main_~s~0.offset (_ bv0 32))) (.cse6 (= (_ bv0 32) (select .cse13 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse7 (= (select .cse10 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7) (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 .cse3 .cse2 .cse4 .cse8 .cse5 .cse6 .cse7 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse12 (bvneg main_~len~0))) (and .cse0 .cse4 .cse8 (= (bvadd (select (select |#memory_int| .cse9) (select .cse10 .cse11)) (_ bv4294967295 32)) (bvneg .cse12)) .cse5 .cse2 (= (bvadd .cse12 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) .cse6 .cse7)))))) [2018-12-09 04:46:58,333 INFO L448 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2018-12-09 04:46:58,333 INFO L448 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2018-12-09 04:46:58,334 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 04:46:58,334 INFO L444 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2018-12-09 04:46:58,334 INFO L448 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-12-09 04:46:58,334 INFO L451 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-12-09 04:46:58,334 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-12-09 04:46:58,334 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2018-12-09 04:46:58,340 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-09 04:46:58,341 INFO L168 Benchmark]: Toolchain (without parser) took 97040.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 938.0 MB in the beginning and 945.3 MB in the end (delta: -7.3 MB). Peak memory consumption was 201.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:46:58,342 INFO L168 Benchmark]: CDTParser took 0.12 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-09 04:46:58,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-09 04:46:58,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.64 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-09 04:46:58,342 INFO L168 Benchmark]: Boogie Preprocessor took 21.51 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:46:58,342 INFO L168 Benchmark]: RCFGBuilder took 295.74 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.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-09 04:46:58,342 INFO L168 Benchmark]: TraceAbstraction took 96422.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 945.3 MB in the end (delta: 123.8 MB). Peak memory consumption was 211.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:46:58,343 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.12 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 278.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.64 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 21.51 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.74 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.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96422.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 945.3 MB in the end (delta: 123.8 MB). Peak memory consumption was 211.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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 - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - 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...