./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2552da43a16cb54d5090a24426eb170717bf5525 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2552da43a16cb54d5090a24426eb170717bf5525 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_81 term size 42 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:45:17,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:45:17,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:45:17,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:45:17,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:45:17,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:45:17,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:45:17,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:45:17,942 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:45:17,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:45:17,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:45:17,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:45:17,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:45:17,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:45:17,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:45:17,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:45:17,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:45:17,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:45:17,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:45:17,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:45:17,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:45:17,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:45:17,963 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:45:17,963 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:45:17,963 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:45:17,964 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:45:17,965 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:45:17,965 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:45:17,966 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:45:17,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:45:17,967 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:45:17,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:45:17,968 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:45:17,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:45:17,969 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:45:17,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:45:17,970 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-27 04:45:17,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:45:17,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:45:17,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:45:17,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:45:17,999 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:45:18,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:45:18,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:45:18,000 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:45:18,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:45:18,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:45:18,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:45:18,000 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:45:18,001 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:45:18,001 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:45:18,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:45:18,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:45:18,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:45:18,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:45:18,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:45:18,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:45:18,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:45:18,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:45:18,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:45:18,002 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 04:45:18,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:45:18,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 2552da43a16cb54d5090a24426eb170717bf5525 [2018-10-27 04:45:18,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:45:18,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:45:18,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:45:18,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:45:18,042 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:45:18,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-10-27 04:45:18,087 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/8cbd5bddd/57b2b094403b48898982b9460c15e901/FLAG00bb99d63 [2018-10-27 04:45:18,508 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:45:18,508 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-10-27 04:45:18,518 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/8cbd5bddd/57b2b094403b48898982b9460c15e901/FLAG00bb99d63 [2018-10-27 04:45:18,531 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/8cbd5bddd/57b2b094403b48898982b9460c15e901 [2018-10-27 04:45:18,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:45:18,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:45:18,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:18,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:45:18,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:45:18,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:18,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3ec45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18, skipping insertion in model container [2018-10-27 04:45:18,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:18,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:45:18,587 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:45:18,836 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:18,844 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:45:18,892 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:18,931 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:45:18,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18 WrapperNode [2018-10-27 04:45:18,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:18,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:45:18,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:45:18,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:45:18,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:18,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:19,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:19,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:19,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:19,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:19,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... [2018-10-27 04:45:19,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:45:19,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:45:19,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:45:19,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:45:19,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:45:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:45:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:45:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-27 04:45:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-27 04:45:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-10-27 04:45:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 04:45:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 04:45:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 04:45:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-27 04:45:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-27 04:45:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 04:45:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 04:45:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 04:45:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 04:45:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 04:45:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 04:45:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 04:45:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 04:45:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 04:45:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 04:45:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 04:45:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 04:45:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 04:45:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 04:45:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 04:45:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 04:45:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 04:45:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 04:45:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 04:45:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 04:45:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 04:45:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 04:45:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 04:45:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 04:45:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 04:45:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 04:45:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 04:45:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 04:45:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 04:45:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 04:45:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 04:45:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 04:45:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 04:45:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 04:45:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 04:45:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 04:45:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 04:45:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 04:45:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:45:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:45:19,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:45:19,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:45:19,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-27 04:45:19,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 04:45:20,033 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:45:20,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:20 BoogieIcfgContainer [2018-10-27 04:45:20,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:45:20,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:45:20,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:45:20,038 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:45:20,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:45:18" (1/3) ... [2018-10-27 04:45:20,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe03db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:20, skipping insertion in model container [2018-10-27 04:45:20,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:18" (2/3) ... [2018-10-27 04:45:20,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe03db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:20, skipping insertion in model container [2018-10-27 04:45:20,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:20" (3/3) ... [2018-10-27 04:45:20,042 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-10-27 04:45:20,050 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:45:20,057 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-10-27 04:45:20,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-10-27 04:45:20,094 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:45:20,095 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:45:20,095 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:45:20,096 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:45:20,096 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:45:20,096 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:45:20,096 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:45:20,097 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:45:20,097 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:45:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-10-27 04:45:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:45:20,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:20,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:20,127 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:20,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 785922242, now seen corresponding path program 1 times [2018-10-27 04:45:20,135 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:20,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:20,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:20,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:20,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:20,381 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-10-27 04:45:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:21,163 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-10-27 04:45:21,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:21,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:45:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:21,175 INFO L225 Difference]: With dead ends: 175 [2018-10-27 04:45:21,175 INFO L226 Difference]: Without dead ends: 172 [2018-10-27 04:45:21,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-27 04:45:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-10-27 04:45:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-27 04:45:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-10-27 04:45:21,219 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-10-27 04:45:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:21,220 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-10-27 04:45:21,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-10-27 04:45:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:45:21,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:21,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:21,221 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:21,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash 785922243, now seen corresponding path program 1 times [2018-10-27 04:45:21,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:21,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:21,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:21,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:21,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:21,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:21,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:21,297 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-10-27 04:45:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:21,631 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-10-27 04:45:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:21,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:45:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:21,633 INFO L225 Difference]: With dead ends: 134 [2018-10-27 04:45:21,633 INFO L226 Difference]: Without dead ends: 134 [2018-10-27 04:45:21,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-27 04:45:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-27 04:45:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-27 04:45:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-27 04:45:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-10-27 04:45:21,643 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-10-27 04:45:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:21,643 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-10-27 04:45:21,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-10-27 04:45:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 04:45:21,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:21,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:21,645 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:21,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash 580924999, now seen corresponding path program 1 times [2018-10-27 04:45:21,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:21,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:21,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:21,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:21,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:21,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:21,711 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-10-27 04:45:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:21,838 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-10-27 04:45:21,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:21,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-27 04:45:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:21,840 INFO L225 Difference]: With dead ends: 132 [2018-10-27 04:45:21,841 INFO L226 Difference]: Without dead ends: 132 [2018-10-27 04:45:21,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-27 04:45:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-27 04:45:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-27 04:45:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 04:45:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-10-27 04:45:21,850 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 12 [2018-10-27 04:45:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:21,851 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-10-27 04:45:21,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-10-27 04:45:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 04:45:21,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:21,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:21,852 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:21,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash 580924998, now seen corresponding path program 1 times [2018-10-27 04:45:21,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:21,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:21,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:21,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:21,929 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 4 states. [2018-10-27 04:45:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:22,127 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-10-27 04:45:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:22,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-27 04:45:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:22,129 INFO L225 Difference]: With dead ends: 146 [2018-10-27 04:45:22,129 INFO L226 Difference]: Without dead ends: 146 [2018-10-27 04:45:22,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-27 04:45:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-27 04:45:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-10-27 04:45:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-27 04:45:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-10-27 04:45:22,140 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-10-27 04:45:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:22,140 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-10-27 04:45:22,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-10-27 04:45:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:45:22,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:22,141 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:22,141 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:22,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash 606309074, now seen corresponding path program 1 times [2018-10-27 04:45:22,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:22,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:22,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:22,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:22,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:22,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:22,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:22,192 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-10-27 04:45:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:22,306 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-10-27 04:45:22,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:22,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-27 04:45:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:22,308 INFO L225 Difference]: With dead ends: 128 [2018-10-27 04:45:22,308 INFO L226 Difference]: Without dead ends: 128 [2018-10-27 04:45:22,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-27 04:45:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-27 04:45:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-10-27 04:45:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-27 04:45:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-10-27 04:45:22,312 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-10-27 04:45:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:22,312 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-10-27 04:45:22,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-10-27 04:45:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:45:22,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:22,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:22,313 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:22,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash 606309075, now seen corresponding path program 1 times [2018-10-27 04:45:22,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:22,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:22,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:22,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:22,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:22,386 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-10-27 04:45:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:22,524 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-10-27 04:45:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:22,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-27 04:45:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:22,525 INFO L225 Difference]: With dead ends: 123 [2018-10-27 04:45:22,525 INFO L226 Difference]: Without dead ends: 123 [2018-10-27 04:45:22,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-27 04:45:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-27 04:45:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-27 04:45:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-27 04:45:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-10-27 04:45:22,530 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-10-27 04:45:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:22,531 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-10-27 04:45:22,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-10-27 04:45:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:45:22,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:22,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:22,534 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:22,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1615712220, now seen corresponding path program 1 times [2018-10-27 04:45:22,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:22,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:22,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:22,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:22,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:22,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:22,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:22,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:22,654 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 8 states. [2018-10-27 04:45:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:22,937 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-10-27 04:45:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:45:22,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-10-27 04:45:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:22,939 INFO L225 Difference]: With dead ends: 230 [2018-10-27 04:45:22,939 INFO L226 Difference]: Without dead ends: 230 [2018-10-27 04:45:22,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-27 04:45:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 144. [2018-10-27 04:45:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-27 04:45:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2018-10-27 04:45:22,946 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 21 [2018-10-27 04:45:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:22,946 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-10-27 04:45:22,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2018-10-27 04:45:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:45:22,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:22,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:22,947 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:22,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1615712221, now seen corresponding path program 1 times [2018-10-27 04:45:22,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:22,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:23,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:23,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:23,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:23,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:23,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:23,140 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 8 states. [2018-10-27 04:45:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:23,358 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-10-27 04:45:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:23,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-10-27 04:45:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:23,360 INFO L225 Difference]: With dead ends: 172 [2018-10-27 04:45:23,360 INFO L226 Difference]: Without dead ends: 172 [2018-10-27 04:45:23,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-27 04:45:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-27 04:45:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-27 04:45:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-10-27 04:45:23,363 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 21 [2018-10-27 04:45:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:23,364 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-10-27 04:45:23,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-10-27 04:45:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 04:45:23,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:23,365 INFO L375 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-10-27 04:45:23,365 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:23,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1686567315, now seen corresponding path program 1 times [2018-10-27 04:45:23,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:23,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:23,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:23,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:23,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-27 04:45:23,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:23,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:23,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:23,708 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 11 states. [2018-10-27 04:45:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:24,757 INFO L93 Difference]: Finished difference Result 172 states and 193 transitions. [2018-10-27 04:45:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:45:24,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-27 04:45:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:24,758 INFO L225 Difference]: With dead ends: 172 [2018-10-27 04:45:24,758 INFO L226 Difference]: Without dead ends: 172 [2018-10-27 04:45:24,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:45:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-27 04:45:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-27 04:45:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-27 04:45:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2018-10-27 04:45:24,763 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 30 [2018-10-27 04:45:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:24,765 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2018-10-27 04:45:24,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2018-10-27 04:45:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:45:24,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:24,766 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:24,766 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:24,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 772749552, now seen corresponding path program 1 times [2018-10-27 04:45:24,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:24,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:24,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:25,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-27 04:45:25,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:45:25,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:45:25,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:45:25,253 INFO L87 Difference]: Start difference. First operand 170 states and 193 transitions. Second operand 14 states. [2018-10-27 04:45:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:25,848 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2018-10-27 04:45:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:45:25,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-10-27 04:45:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:25,850 INFO L225 Difference]: With dead ends: 196 [2018-10-27 04:45:25,850 INFO L226 Difference]: Without dead ends: 196 [2018-10-27 04:45:25,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-10-27 04:45:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-27 04:45:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 161. [2018-10-27 04:45:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-27 04:45:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-10-27 04:45:25,854 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 32 [2018-10-27 04:45:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:25,854 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-10-27 04:45:25,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:45:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-10-27 04:45:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-27 04:45:25,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:25,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:25,857 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:25,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:25,858 INFO L82 PathProgramCache]: Analyzing trace with hash 711958709, now seen corresponding path program 1 times [2018-10-27 04:45:25,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:25,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:25,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:25,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:25,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:25,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:25,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:45:25,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:45:25,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:25,962 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 3 states. [2018-10-27 04:45:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:26,077 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-10-27 04:45:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:45:26,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-27 04:45:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:26,079 INFO L225 Difference]: With dead ends: 170 [2018-10-27 04:45:26,079 INFO L226 Difference]: Without dead ends: 170 [2018-10-27 04:45:26,079 INFO L605 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-10-27 04:45:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-27 04:45:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-10-27 04:45:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-27 04:45:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-10-27 04:45:26,082 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 38 [2018-10-27 04:45:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:26,082 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-10-27 04:45:26,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:45:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-10-27 04:45:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 04:45:26,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:26,083 INFO L375 BasicCegarLoop]: trace histogram [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-10-27 04:45:26,086 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:26,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1341440963, now seen corresponding path program 1 times [2018-10-27 04:45:26,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:26,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:26,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:26,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:26,334 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:45:26,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:26,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:26,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:26,736 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:26,740 INFO L477 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-10-27 04:45:26,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:26,760 INFO L477 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 12 treesize of output 15 [2018-10-27 04:45:26,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:26,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:26,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-10-27 04:45:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:26,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:26,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-10-27 04:45:26,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:45:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:45:26,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:45:26,913 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 22 states. [2018-10-27 04:45:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:27,682 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2018-10-27 04:45:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:45:27,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-10-27 04:45:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:27,684 INFO L225 Difference]: With dead ends: 196 [2018-10-27 04:45:27,684 INFO L226 Difference]: Without dead ends: 196 [2018-10-27 04:45:27,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-10-27 04:45:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-27 04:45:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-10-27 04:45:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-27 04:45:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2018-10-27 04:45:27,692 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 41 [2018-10-27 04:45:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:27,692 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2018-10-27 04:45:27,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:45:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2018-10-27 04:45:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:45:27,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:27,693 INFO L375 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-10-27 04:45:27,693 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:27,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1647355763, now seen corresponding path program 1 times [2018-10-27 04:45:27,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:27,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:27,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:27,839 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:45:27,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:27,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:28,020 INFO L477 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 12 treesize of output 11 [2018-10-27 04:45:28,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:28,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:28,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-10-27 04:45:28,044 INFO L477 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 12 treesize of output 11 [2018-10-27 04:45:28,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:28,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:28,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:45:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:28,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:28,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-10-27 04:45:28,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:45:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:45:28,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=191, Unknown=8, NotChecked=0, Total=240 [2018-10-27 04:45:28,101 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 16 states. [2018-10-27 04:45:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:28,976 INFO L93 Difference]: Finished difference Result 196 states and 204 transitions. [2018-10-27 04:45:28,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:45:28,977 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-10-27 04:45:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:28,978 INFO L225 Difference]: With dead ends: 196 [2018-10-27 04:45:28,978 INFO L226 Difference]: Without dead ends: 196 [2018-10-27 04:45:28,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=504, Unknown=9, NotChecked=0, Total=650 [2018-10-27 04:45:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-27 04:45:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 159. [2018-10-27 04:45:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-27 04:45:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-10-27 04:45:28,985 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 43 [2018-10-27 04:45:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:28,985 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-10-27 04:45:28,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:45:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-10-27 04:45:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:45:28,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:28,986 INFO L375 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-10-27 04:45:28,986 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:28,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1647355762, now seen corresponding path program 1 times [2018-10-27 04:45:28,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:28,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:28,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:29,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:29,400 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:45:29,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:29,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:29,535 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| Int)) (= (store |c_old(#length)| |append_#t~malloc2.base| 9) |c_#length|)) is different from true [2018-10-27 04:45:29,559 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 20 [2018-10-27 04:45:29,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:29,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:29,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2018-10-27 04:45:29,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2018-10-27 04:45:29,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-10-27 04:45:29,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:29,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-10-27 04:45:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-27 04:45:29,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:29,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-10-27 04:45:29,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 04:45:29,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 04:45:29,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2018-10-27 04:45:29,829 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 21 states. [2018-10-27 04:45:31,233 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 04:45:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:32,079 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2018-10-27 04:45:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 04:45:32,079 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-10-27 04:45:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:32,080 INFO L225 Difference]: With dead ends: 192 [2018-10-27 04:45:32,080 INFO L226 Difference]: Without dead ends: 192 [2018-10-27 04:45:32,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=789, Unknown=1, NotChecked=58, Total=992 [2018-10-27 04:45:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-27 04:45:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2018-10-27 04:45:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-27 04:45:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 202 transitions. [2018-10-27 04:45:32,089 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 202 transitions. Word has length 43 [2018-10-27 04:45:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:32,089 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 202 transitions. [2018-10-27 04:45:32,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 04:45:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 202 transitions. [2018-10-27 04:45:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 04:45:32,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:32,090 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:32,090 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:32,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:32,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1201636877, now seen corresponding path program 1 times [2018-10-27 04:45:32,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:32,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:32,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,560 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-27 04:45:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:33,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:33,362 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:45:33,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:33,550 INFO L477 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 12 treesize of output 11 [2018-10-27 04:45:33,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-27 04:45:33,844 INFO L477 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 13 treesize of output 10 [2018-10-27 04:45:33,850 INFO L477 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 10 treesize of output 9 [2018-10-27 04:45:33,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-27 04:45:33,902 INFO L477 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 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:45:33,906 INFO L477 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 24 treesize of output 23 [2018-10-27 04:45:33,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,939 INFO L477 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 21 treesize of output 30 [2018-10-27 04:45:33,939 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:33,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:33,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:33,964 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-10-27 04:45:34,061 INFO L477 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 68 treesize of output 65 [2018-10-27 04:45:34,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,112 INFO L477 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 61 treesize of output 76 [2018-10-27 04:45:34,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 54 [2018-10-27 04:45:34,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:34,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:34,216 INFO L477 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 33 treesize of output 28 [2018-10-27 04:45:34,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,262 INFO L477 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-10-27 04:45:34,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,270 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,290 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 3 xjuncts. [2018-10-27 04:45:34,291 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-10-27 04:45:34,379 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:45:34,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,464 INFO L477 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 17 treesize of output 10 [2018-10-27 04:45:34,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:34,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-10-27 04:45:34,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:34,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-10-27 04:45:34,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:34,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-10-27 04:45:35,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-10-27 04:45:35,066 INFO L477 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 10 treesize of output 9 [2018-10-27 04:45:35,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:35,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-10-27 04:45:35,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-10-27 04:45:35,158 INFO L477 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 10 treesize of output 9 [2018-10-27 04:45:35,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:35,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-10-27 04:45:35,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-10-27 04:45:35,307 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:35,308 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:45:35,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,373 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:35,374 INFO L477 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 33 treesize of output 21 [2018-10-27 04:45:35,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,381 INFO L477 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-10-27 04:45:35,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:35,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-10-27 04:45:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:35,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:35,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2018-10-27 04:45:35,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-27 04:45:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-27 04:45:35,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1845, Unknown=0, NotChecked=0, Total=1980 [2018-10-27 04:45:35,471 INFO L87 Difference]: Start difference. First operand 186 states and 202 transitions. Second operand 45 states. [2018-10-27 04:45:36,554 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2018-10-27 04:45:37,540 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 77 [2018-10-27 04:45:37,988 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2018-10-27 04:45:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:39,846 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-10-27 04:45:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-27 04:45:39,846 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 50 [2018-10-27 04:45:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:39,848 INFO L225 Difference]: With dead ends: 248 [2018-10-27 04:45:39,848 INFO L226 Difference]: Without dead ends: 248 [2018-10-27 04:45:39,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=694, Invalid=5468, Unknown=0, NotChecked=0, Total=6162 [2018-10-27 04:45:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-27 04:45:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 186. [2018-10-27 04:45:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-27 04:45:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2018-10-27 04:45:39,857 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 50 [2018-10-27 04:45:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:39,858 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2018-10-27 04:45:39,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-27 04:45:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2018-10-27 04:45:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 04:45:39,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:39,859 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:39,859 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:39,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1201636878, now seen corresponding path program 1 times [2018-10-27 04:45:39,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:39,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:39,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:39,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:40,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:40,552 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:45:40,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:40,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:40,642 INFO L477 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 12 treesize of output 11 [2018-10-27 04:45:40,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-27 04:45:40,726 INFO L477 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-10-27 04:45:40,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-10-27 04:45:40,801 INFO L477 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 13 treesize of output 10 [2018-10-27 04:45:40,803 INFO L477 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 10 treesize of output 9 [2018-10-27 04:45:40,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,813 INFO L477 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 13 treesize of output 10 [2018-10-27 04:45:40,816 INFO L477 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 10 treesize of output 9 [2018-10-27 04:45:40,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-27 04:45:40,866 INFO L477 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 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:45:40,875 INFO L477 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 21 treesize of output 30 [2018-10-27 04:45:40,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:40,895 INFO L477 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-10-27 04:45:40,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:40,953 INFO L477 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 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:45:40,956 INFO L477 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 24 treesize of output 23 [2018-10-27 04:45:40,956 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:40,980 INFO L477 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 21 treesize of output 30 [2018-10-27 04:45:40,980 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:40,993 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:41,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:45:41,015 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:60, output treesize:203 [2018-10-27 04:45:41,099 INFO L477 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 72 treesize of output 67 [2018-10-27 04:45:41,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,102 INFO L477 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-10-27 04:45:41,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,158 INFO L477 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 68 treesize of output 63 [2018-10-27 04:45:41,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,197 INFO L477 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-10-27 04:45:41,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,264 INFO L477 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 162 treesize of output 151 [2018-10-27 04:45:41,269 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,269 INFO L477 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 155 treesize of output 182 [2018-10-27 04:45:41,270 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,335 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 138 treesize of output 146 [2018-10-27 04:45:41,347 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:41,412 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:41,492 INFO L477 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 3 case distinctions, treesize of input 152 treesize of output 152 [2018-10-27 04:45:41,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,498 INFO L477 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 145 treesize of output 172 [2018-10-27 04:45:41,499 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 132 treesize of output 150 [2018-10-27 04:45:41,569 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:41,607 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:45:41,610 INFO L477 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 117 treesize of output 98 [2018-10-27 04:45:41,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:41,723 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:41,769 INFO L303 Elim1Store]: Index analysis took 157 ms [2018-10-27 04:45:41,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 83 treesize of output 54 [2018-10-27 04:45:41,770 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,783 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:41,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:45:41,830 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:235, output treesize:267 [2018-10-27 04:45:42,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,299 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,300 INFO L477 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 150 treesize of output 144 [2018-10-27 04:45:42,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:291, output treesize:144 [2018-10-27 04:45:42,528 INFO L477 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 37 treesize of output 26 [2018-10-27 04:45:42,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,550 INFO L477 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-10-27 04:45:42,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:42,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:141 [2018-10-27 04:45:42,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 130 [2018-10-27 04:45:42,751 INFO L477 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 130 treesize of output 129 [2018-10-27 04:45:42,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,800 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 139 [2018-10-27 04:45:42,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:45:42,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:45:42,927 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 119 [2018-10-27 04:45:42,930 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,932 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:42,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 90 [2018-10-27 04:45:42,935 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,959 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 119 [2018-10-27 04:45:42,962 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:42,963 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:42,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 76 [2018-10-27 04:45:42,966 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,980 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:42,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 168 [2018-10-27 04:45:43,002 INFO L477 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 159 treesize of output 158 [2018-10-27 04:45:43,003 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,056 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:43,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 168 [2018-10-27 04:45:43,072 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-27 04:45:43,130 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:45:43,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-27 04:45:43,196 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:170, output treesize:339 [2018-10-27 04:45:43,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 190 [2018-10-27 04:45:43,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:43,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 187 [2018-10-27 04:45:43,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,449 INFO L477 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 167 treesize of output 166 [2018-10-27 04:45:43,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,633 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:43,633 INFO L477 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 155 treesize of output 141 [2018-10-27 04:45:43,636 INFO L477 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 36 treesize of output 21 [2018-10-27 04:45:43,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,763 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:43,764 INFO L477 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 124 treesize of output 107 [2018-10-27 04:45:43,766 INFO L477 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 36 treesize of output 21 [2018-10-27 04:45:43,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,777 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:43,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 177 [2018-10-27 04:45:43,904 INFO L477 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 177 treesize of output 176 [2018-10-27 04:45:43,904 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,030 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,105 INFO L477 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 155 treesize of output 141 [2018-10-27 04:45:44,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,111 INFO L477 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 36 treesize of output 63 [2018-10-27 04:45:44,112 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,138 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,227 INFO L477 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 145 treesize of output 128 [2018-10-27 04:45:44,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,231 INFO L477 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 36 treesize of output 63 [2018-10-27 04:45:44,231 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,248 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-10-27 04:45:44,304 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:481, output treesize:391 [2018-10-27 04:45:44,694 INFO L477 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 153 treesize of output 134 [2018-10-27 04:45:44,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,698 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 04:45:44,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,719 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:44,720 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-10-27 04:45:44,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,768 INFO L477 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-10-27 04:45:44,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:44,774 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-10-27 04:45:44,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,789 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:44,789 INFO L477 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 24 treesize of output 16 [2018-10-27 04:45:44,789 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,875 INFO L477 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 111 treesize of output 102 [2018-10-27 04:45:44,877 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:44,878 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-10-27 04:45:44,878 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,894 INFO L477 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 13 treesize of output 1 [2018-10-27 04:45:44,894 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,906 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,929 INFO L477 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 67 treesize of output 57 [2018-10-27 04:45:44,932 INFO L477 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 1 [2018-10-27 04:45:44,932 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,943 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:44,943 INFO L477 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 24 treesize of output 16 [2018-10-27 04:45:44,944 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,951 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:44,969 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:265, output treesize:14 [2018-10-27 04:45:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:45,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:45,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-10-27 04:45:45,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-27 04:45:45,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-27 04:45:45,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1608, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 04:45:45,033 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand 42 states. [2018-10-27 04:45:45,818 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2018-10-27 04:45:46,037 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-10-27 04:45:46,522 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 62 [2018-10-27 04:45:46,939 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 102 [2018-10-27 04:45:47,395 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 72 [2018-10-27 04:45:47,668 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 102 [2018-10-27 04:45:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:49,159 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2018-10-27 04:45:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 04:45:49,160 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-10-27 04:45:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:49,161 INFO L225 Difference]: With dead ends: 245 [2018-10-27 04:45:49,161 INFO L226 Difference]: Without dead ends: 245 [2018-10-27 04:45:49,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=547, Invalid=4283, Unknown=0, NotChecked=0, Total=4830 [2018-10-27 04:45:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-27 04:45:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 186. [2018-10-27 04:45:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-27 04:45:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2018-10-27 04:45:49,171 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 50 [2018-10-27 04:45:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:49,172 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2018-10-27 04:45:49,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-27 04:45:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2018-10-27 04:45:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:45:49,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:49,173 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:49,173 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:49,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash -369642276, now seen corresponding path program 1 times [2018-10-27 04:45:49,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:49,736 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 04:45:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:50,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:50,165 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:45:50,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:50,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:50,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,229 INFO L477 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-10-27 04:45:50,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-10-27 04:45:50,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:45:50,241 INFO L477 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-10-27 04:45:50,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:45:50,251 INFO L477 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-10-27 04:45:50,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-10-27 04:45:50,276 INFO L477 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 21 treesize of output 16 [2018-10-27 04:45:50,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,279 INFO L477 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 16 treesize of output 23 [2018-10-27 04:45:50,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,294 INFO L477 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 21 treesize of output 16 [2018-10-27 04:45:50,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,296 INFO L477 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 16 treesize of output 23 [2018-10-27 04:45:50,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-10-27 04:45:50,493 WARN L854 $PredicateComparison]: unable to prove that (exists ((append_~head.offset Int) (append_~node~0.offset Int) (append_~node~0.base Int)) (let ((.cse1 (+ append_~node~0.offset 1)) (.cse2 (+ append_~node~0.offset 5)) (.cse3 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c_append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~head.base|) append_~head.offset append_~node~0.offset) .cse3 append_~node~0.offset)))) (store .cse0 append_~node~0.base (store (store (select .cse0 append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c_append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_append_#in~head.base|) append_~head.offset append_~node~0.base) .cse3 append_~node~0.base)))) (store .cse4 append_~node~0.base (store (store (select .cse4 append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-10-27 04:45:50,625 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 04:45:50,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,635 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:50,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-10-27 04:45:50,752 INFO L477 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 13 treesize of output 16 [2018-10-27 04:45:50,756 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,757 INFO L477 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 16 treesize of output 23 [2018-10-27 04:45:50,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-10-27 04:45:50,810 INFO L477 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-10-27 04:45:50,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,814 INFO L477 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-10-27 04:45:50,814 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,821 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,860 INFO L477 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 59 treesize of output 61 [2018-10-27 04:45:50,863 INFO L477 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 38 treesize of output 37 [2018-10-27 04:45:50,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,867 INFO L477 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 37 treesize of output 41 [2018-10-27 04:45:50,867 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,875 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,904 INFO L477 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 51 treesize of output 51 [2018-10-27 04:45:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 04:45:50,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,927 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,930 INFO L477 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 36 treesize of output 61 [2018-10-27 04:45:50,931 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:50,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:50,972 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:50,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-10-27 04:45:50,975 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 55 [2018-10-27 04:45:51,056 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:51,097 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:45:51,137 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:45:51,224 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:45:51,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-10-27 04:45:51,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-10-27 04:45:51,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:45:51,367 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,373 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-10-27 04:45:51,396 INFO L477 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-10-27 04:45:51,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,399 INFO L477 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-10-27 04:45:51,400 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,405 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,417 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,427 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,434 INFO L477 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 59 treesize of output 61 [2018-10-27 04:45:51,446 INFO L477 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 38 treesize of output 37 [2018-10-27 04:45:51,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-10-27 04:45:51,451 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,458 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,478 INFO L477 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 51 treesize of output 51 [2018-10-27 04:45:51,496 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 04:45:51,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,518 INFO L477 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 36 treesize of output 61 [2018-10-27 04:45:51,519 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,555 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 55 [2018-10-27 04:45:51,572 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-27 04:45:51,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:51,639 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:45:51,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-10-27 04:45:51,641 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:51,669 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:45:51,701 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:45:51,785 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:45:51,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 20 dim-0 vars, and 10 xjuncts. [2018-10-27 04:45:51,885 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:135, output treesize:977 [2018-10-27 04:45:53,994 WARN L179 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 261 DAG size of output: 38 [2018-10-27 04:45:54,252 INFO L477 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 42 treesize of output 36 [2018-10-27 04:45:54,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:54,285 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:45:54,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:54,484 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:45:54,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:54,808 INFO L477 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 42 treesize of output 36 [2018-10-27 04:45:54,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:54,849 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:45:54,849 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:55,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:55,035 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:45:55,035 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:55,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:55,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:55,224 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:87, output treesize:7 [2018-10-27 04:45:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:55,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:55,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 27 [2018-10-27 04:45:55,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 04:45:55,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 04:45:55,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=560, Unknown=12, NotChecked=48, Total=702 [2018-10-27 04:45:55,269 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand 27 states. [2018-10-27 04:45:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:59,007 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2018-10-27 04:45:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 04:45:59,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-10-27 04:45:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:59,010 INFO L225 Difference]: With dead ends: 243 [2018-10-27 04:45:59,010 INFO L226 Difference]: Without dead ends: 243 [2018-10-27 04:45:59,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=312, Invalid=1990, Unknown=54, NotChecked=94, Total=2450 [2018-10-27 04:45:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-27 04:45:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 203. [2018-10-27 04:45:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-27 04:45:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2018-10-27 04:45:59,018 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 52 [2018-10-27 04:45:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:59,018 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2018-10-27 04:45:59,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 04:45:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2018-10-27 04:45:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 04:45:59,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:59,019 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:59,020 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:45:59,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -677640289, now seen corresponding path program 1 times [2018-10-27 04:45:59,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:59,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:59,600 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 04:46:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:00,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:00,015 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:46:00,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:00,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:00,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,076 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,076 INFO L477 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-10-27 04:46:00,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-27 04:46:00,138 INFO L477 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 13 treesize of output 10 [2018-10-27 04:46:00,140 INFO L477 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 10 treesize of output 9 [2018-10-27 04:46:00,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,149 INFO L477 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 13 treesize of output 10 [2018-10-27 04:46:00,151 INFO L477 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 10 treesize of output 9 [2018-10-27 04:46:00,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-10-27 04:46:00,298 WARN L854 $PredicateComparison]: unable to prove that (exists ((append_~head.offset Int) (append_~node~0.offset Int) (append_~node~0.base Int)) (let ((.cse1 (+ append_~node~0.offset 1)) (.cse2 (+ append_~node~0.offset 5)) (.cse3 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c_append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~head.base|) append_~head.offset append_~node~0.offset) .cse3 append_~node~0.offset)))) (store .cse0 append_~node~0.base (store (store (select .cse0 append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c_append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_append_#in~head.base|) append_~head.offset append_~node~0.base) .cse3 append_~node~0.base)))) (store .cse4 append_~node~0.base (store (store (select .cse4 append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-10-27 04:46:00,407 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 04:46:00,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,420 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,420 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:46:00,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2018-10-27 04:46:00,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-10-27 04:46:00,536 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:46:00,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-10-27 04:46:00,575 INFO L477 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-10-27 04:46:00,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,578 INFO L477 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-10-27 04:46:00,578 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,617 INFO L477 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 52 treesize of output 54 [2018-10-27 04:46:00,620 INFO L477 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 38 treesize of output 37 [2018-10-27 04:46:00,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-10-27 04:46:00,623 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,632 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,654 INFO L477 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 44 treesize of output 44 [2018-10-27 04:46:00,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 04:46:00,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 55 [2018-10-27 04:46:00,715 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:00,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,769 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:46:00,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-10-27 04:46:00,771 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,830 INFO L477 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 30 treesize of output 55 [2018-10-27 04:46:00,831 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,900 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:46:00,937 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:46:00,999 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:46:01,097 INFO L477 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 52 treesize of output 54 [2018-10-27 04:46:01,100 INFO L477 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 38 treesize of output 37 [2018-10-27 04:46:01,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,103 INFO L477 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 37 treesize of output 41 [2018-10-27 04:46:01,104 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,111 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,127 INFO L477 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 44 treesize of output 44 [2018-10-27 04:46:01,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 04:46:01,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,226 INFO L477 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 36 treesize of output 61 [2018-10-27 04:46:01,226 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,258 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 55 [2018-10-27 04:46:01,278 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:01,311 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,313 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:46:01,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-10-27 04:46:01,315 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,364 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:46:01,391 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:46:01,422 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:46:01,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2018-10-27 04:46:01,452 INFO L477 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 13 treesize of output 16 [2018-10-27 04:46:01,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,455 INFO L477 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 16 treesize of output 23 [2018-10-27 04:46:01,455 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,580 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-10-27 04:46:01,601 INFO L477 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-10-27 04:46:01,603 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:01,604 INFO L477 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-10-27 04:46:01,604 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,609 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,618 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,627 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:01,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-10-27 04:46:01,717 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:124, output treesize:974 [2018-10-27 04:46:39,137 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 35 [2018-10-27 04:46:39,445 INFO L477 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 37 treesize of output 33 [2018-10-27 04:46:39,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:39,449 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:46:39,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:39,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:46:39,457 INFO L477 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 15 treesize of output 11 [2018-10-27 04:46:39,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:39,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:39,475 INFO L477 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 37 treesize of output 33 [2018-10-27 04:46:39,478 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:46:39,478 INFO L477 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 15 treesize of output 11 [2018-10-27 04:46:39,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:39,487 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:39,487 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:46:39,488 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:39,491 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:39,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:39,499 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:86, output treesize:7 [2018-10-27 04:46:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:39,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:39,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 37 [2018-10-27 04:46:39,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-27 04:46:39,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 04:46:39,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1131, Unknown=15, NotChecked=68, Total=1332 [2018-10-27 04:46:39,617 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand 37 states. [2018-10-27 04:46:40,680 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 04:46:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:43,955 INFO L93 Difference]: Finished difference Result 241 states and 256 transitions. [2018-10-27 04:46:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-27 04:46:43,956 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2018-10-27 04:46:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:43,957 INFO L225 Difference]: With dead ends: 241 [2018-10-27 04:46:43,958 INFO L226 Difference]: Without dead ends: 241 [2018-10-27 04:46:43,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=448, Invalid=3652, Unknown=64, NotChecked=126, Total=4290 [2018-10-27 04:46:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-27 04:46:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 200. [2018-10-27 04:46:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-27 04:46:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 215 transitions. [2018-10-27 04:46:43,964 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 215 transitions. Word has length 54 [2018-10-27 04:46:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:43,967 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 215 transitions. [2018-10-27 04:46:43,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-27 04:46:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 215 transitions. [2018-10-27 04:46:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 04:46:43,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:43,968 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:43,968 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:46:43,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash 462399030, now seen corresponding path program 1 times [2018-10-27 04:46:43,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:43,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:43,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:43,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 04:46:44,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:44,137 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:46:44,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:44,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 04:46:44,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:44,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 04:46:44,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:44,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:44,345 INFO L87 Difference]: Start difference. First operand 200 states and 215 transitions. Second operand 5 states. [2018-10-27 04:46:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:44,624 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2018-10-27 04:46:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:44,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-10-27 04:46:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:44,626 INFO L225 Difference]: With dead ends: 230 [2018-10-27 04:46:44,626 INFO L226 Difference]: Without dead ends: 230 [2018-10-27 04:46:44,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-27 04:46:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 213. [2018-10-27 04:46:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-27 04:46:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 234 transitions. [2018-10-27 04:46:44,630 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 234 transitions. Word has length 58 [2018-10-27 04:46:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:44,630 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 234 transitions. [2018-10-27 04:46:44,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 234 transitions. [2018-10-27 04:46:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 04:46:44,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:44,632 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:44,632 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:46:44,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:44,632 INFO L82 PathProgramCache]: Analyzing trace with hash -831255197, now seen corresponding path program 1 times [2018-10-27 04:46:44,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:44,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 04:46:44,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:44,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:44,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:44,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:44,740 INFO L87 Difference]: Start difference. First operand 213 states and 234 transitions. Second operand 3 states. [2018-10-27 04:46:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:44,813 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2018-10-27 04:46:44,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:44,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-27 04:46:44,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:44,815 INFO L225 Difference]: With dead ends: 215 [2018-10-27 04:46:44,815 INFO L226 Difference]: Without dead ends: 215 [2018-10-27 04:46:44,815 INFO L605 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-10-27 04:46:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-27 04:46:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-27 04:46:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-27 04:46:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2018-10-27 04:46:44,822 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 64 [2018-10-27 04:46:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:44,822 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2018-10-27 04:46:44,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2018-10-27 04:46:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-27 04:46:44,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:44,823 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:44,823 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:46:44,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash -746146138, now seen corresponding path program 1 times [2018-10-27 04:46:44,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:45,372 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-10-27 04:46:45,646 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-27 04:46:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:45,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:45,960 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:45,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:45,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:46,024 INFO L477 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 12 treesize of output 11 [2018-10-27 04:46:46,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:46:46,188 INFO L477 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-10-27 04:46:46,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:46:46,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-10-27 04:46:46,225 INFO L477 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 21 treesize of output 16 [2018-10-27 04:46:46,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:46:46,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-10-27 04:46:46,278 INFO L477 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 3 case distinctions, treesize of input 30 treesize of output 40 [2018-10-27 04:46:46,280 INFO L477 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 31 treesize of output 30 [2018-10-27 04:46:46,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,306 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,319 INFO L477 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 4 case distinctions, treesize of input 26 treesize of output 53 [2018-10-27 04:46:46,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:46:46,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:46:46,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:46:46,372 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:108 [2018-10-27 04:46:46,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 40 [2018-10-27 04:46:46,432 INFO L477 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 31 treesize of output 27 [2018-10-27 04:46:46,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,486 INFO L477 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 75 treesize of output 66 [2018-10-27 04:46:46,489 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,489 INFO L477 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 64 treesize of output 77 [2018-10-27 04:46:46,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 91 [2018-10-27 04:46:46,536 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:46,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:46:46,615 INFO L477 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 39 treesize of output 32 [2018-10-27 04:46:46,617 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,619 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,620 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,621 INFO L477 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 23 treesize of output 60 [2018-10-27 04:46:46,621 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,631 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 04:46:46,664 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:154, output treesize:170 [2018-10-27 04:46:46,737 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,738 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:46,739 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-10-27 04:46:46,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:46,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:46,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:190, output treesize:60 [2018-10-27 04:46:47,099 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-27 04:46:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:47,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-10-27 04:46:47,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 04:46:47,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 04:46:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 04:46:47,140 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand 33 states. [2018-10-27 04:46:48,152 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2018-10-27 04:46:48,332 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2018-10-27 04:46:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:50,038 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-10-27 04:46:50,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 04:46:50,039 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-10-27 04:46:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:50,040 INFO L225 Difference]: With dead ends: 250 [2018-10-27 04:46:50,041 INFO L226 Difference]: Without dead ends: 231 [2018-10-27 04:46:50,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=519, Invalid=3771, Unknown=0, NotChecked=0, Total=4290 [2018-10-27 04:46:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-27 04:46:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 186. [2018-10-27 04:46:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-27 04:46:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2018-10-27 04:46:50,049 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 66 [2018-10-27 04:46:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:50,050 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2018-10-27 04:46:50,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 04:46:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2018-10-27 04:46:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-27 04:46:50,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:50,051 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10-27 04:46:50,051 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:46:50,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -165750136, now seen corresponding path program 1 times [2018-10-27 04:46:50,060 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:50,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:50,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:46:50,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:50,412 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:46:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:50,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:50,647 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:50,649 INFO L477 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 12 treesize of output 15 [2018-10-27 04:46:50,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:50,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:50,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:50,659 INFO L477 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-10-27 04:46:50,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:50,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:50,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-10-27 04:46:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:46:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-10-27 04:46:50,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 04:46:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 04:46:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:46:50,737 INFO L87 Difference]: Start difference. First operand 186 states and 199 transitions. Second operand 23 states. [2018-10-27 04:46:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:51,542 INFO L93 Difference]: Finished difference Result 228 states and 237 transitions. [2018-10-27 04:46:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:46:51,543 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-10-27 04:46:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:51,544 INFO L225 Difference]: With dead ends: 228 [2018-10-27 04:46:51,545 INFO L226 Difference]: Without dead ends: 228 [2018-10-27 04:46:51,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-10-27 04:46:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-27 04:46:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2018-10-27 04:46:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-27 04:46:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-10-27 04:46:51,549 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 66 [2018-10-27 04:46:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:51,549 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-10-27 04:46:51,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 04:46:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-10-27 04:46:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 04:46:51,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:51,550 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:51,550 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:46:51,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1442223950, now seen corresponding path program 1 times [2018-10-27 04:46:51,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:51,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:52,052 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:46:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:52,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:52,277 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:52,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:52,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:52,386 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| Int)) (and (= (store |c_old(#length)| |append_#t~malloc2.base| 9) |c_#length|) (= (select |c_old(#valid)| |append_#t~malloc2.base|) 0))) is different from true [2018-10-27 04:46:52,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:52,393 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:52,394 INFO L477 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-10-27 04:46:52,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:52,403 INFO L477 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 14 treesize of output 17 [2018-10-27 04:46:52,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:52,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:52,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-10-27 04:46:52,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 31 [2018-10-27 04:46:52,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:52,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:52,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:27 [2018-10-27 04:46:52,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 29 [2018-10-27 04:46:52,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:52,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:52,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-10-27 04:46:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2018-10-27 04:46:52,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:52,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-10-27 04:46:52,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 04:46:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 04:46:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=568, Unknown=2, NotChecked=48, Total=702 [2018-10-27 04:46:52,660 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 27 states. [2018-10-27 04:46:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:53,599 INFO L93 Difference]: Finished difference Result 211 states and 223 transitions. [2018-10-27 04:46:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:46:53,601 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68 [2018-10-27 04:46:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:53,602 INFO L225 Difference]: With dead ends: 211 [2018-10-27 04:46:53,602 INFO L226 Difference]: Without dead ends: 211 [2018-10-27 04:46:53,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=1135, Unknown=2, NotChecked=70, Total=1406 [2018-10-27 04:46:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-27 04:46:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2018-10-27 04:46:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 04:46:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-10-27 04:46:53,606 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 68 [2018-10-27 04:46:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:53,606 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-10-27 04:46:53,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 04:46:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-10-27 04:46:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 04:46:53,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:53,607 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2018-10-27 04:46:53,609 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:46:53,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1301737182, now seen corresponding path program 1 times [2018-10-27 04:46:53,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:53,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:53,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:53,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:53,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:46:54,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:54,731 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:46:54,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:54,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:54,917 INFO L477 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 12 treesize of output 11 [2018-10-27 04:46:54,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:54,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:54,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-10-27 04:46:55,139 INFO L477 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 13 treesize of output 10 [2018-10-27 04:46:55,141 INFO L477 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 10 treesize of output 9 [2018-10-27 04:46:55,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-27 04:46:55,199 INFO L477 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 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:46:55,202 INFO L477 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 24 treesize of output 23 [2018-10-27 04:46:55,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,227 INFO L477 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 21 treesize of output 30 [2018-10-27 04:46:55,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:55,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:46:55,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:46:55,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-10-27 04:46:55,334 INFO L477 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 33 treesize of output 28 [2018-10-27 04:46:55,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,338 INFO L477 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-10-27 04:46:55,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,378 INFO L477 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 68 treesize of output 65 [2018-10-27 04:46:55,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 54 [2018-10-27 04:46:55,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:55,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,431 INFO L477 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 51 treesize of output 66 [2018-10-27 04:46:55,432 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:46:55,477 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 3 xjuncts. [2018-10-27 04:46:55,478 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-10-27 04:46:55,554 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:46:55,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,575 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,576 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,577 INFO L477 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 17 treesize of output 10 [2018-10-27 04:46:55,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:55,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-10-27 04:46:55,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:55,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-10-27 04:46:55,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:55,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-10-27 04:46:56,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-10-27 04:46:56,019 INFO L477 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 10 treesize of output 9 [2018-10-27 04:46:56,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:56,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-10-27 04:46:56,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-10-27 04:46:56,121 INFO L477 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 10 treesize of output 9 [2018-10-27 04:46:56,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:56,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-10-27 04:46:56,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-10-27 04:46:56,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:56,240 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:46:56,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,251 INFO L477 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-10-27 04:46:56,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,259 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:46:56,260 INFO L477 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 33 treesize of output 21 [2018-10-27 04:46:56,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:56,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-10-27 04:46:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 14 refuted. 16 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:46:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:56,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-10-27 04:46:56,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-27 04:46:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-27 04:46:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2081, Unknown=29, NotChecked=0, Total=2256 [2018-10-27 04:46:56,360 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 48 states. [2018-10-27 04:46:58,415 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 71 [2018-10-27 04:46:58,738 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 74 [2018-10-27 04:46:58,946 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 56 [2018-10-27 04:47:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:00,780 INFO L93 Difference]: Finished difference Result 303 states and 318 transitions. [2018-10-27 04:47:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 04:47:00,781 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 72 [2018-10-27 04:47:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:00,783 INFO L225 Difference]: With dead ends: 303 [2018-10-27 04:47:00,783 INFO L226 Difference]: Without dead ends: 303 [2018-10-27 04:47:00,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=761, Invalid=5525, Unknown=34, NotChecked=0, Total=6320 [2018-10-27 04:47:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-27 04:47:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 205. [2018-10-27 04:47:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 04:47:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 219 transitions. [2018-10-27 04:47:00,788 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 219 transitions. Word has length 72 [2018-10-27 04:47:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:00,788 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 219 transitions. [2018-10-27 04:47:00,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-27 04:47:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 219 transitions. [2018-10-27 04:47:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 04:47:00,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:00,789 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2018-10-27 04:47:00,790 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:47:00,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1301737183, now seen corresponding path program 1 times [2018-10-27 04:47:00,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:00,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:01,176 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 04:47:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:47:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:01,887 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:01,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:02,090 INFO L477 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 12 treesize of output 11 [2018-10-27 04:47:02,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:02,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-10-27 04:47:02,149 INFO L477 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-10-27 04:47:02,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-10-27 04:47:02,255 INFO L477 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 13 treesize of output 10 [2018-10-27 04:47:02,257 INFO L477 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 10 treesize of output 9 [2018-10-27 04:47:02,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,270 INFO L477 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 13 treesize of output 10 [2018-10-27 04:47:02,272 INFO L477 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 10 treesize of output 9 [2018-10-27 04:47:02,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-27 04:47:02,338 INFO L477 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 3 case distinctions, treesize of input 23 treesize of output 53 [2018-10-27 04:47:02,341 INFO L477 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 35 [2018-10-27 04:47:02,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,366 INFO L477 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 33 treesize of output 48 [2018-10-27 04:47:02,366 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:02,403 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-10-27 04:47:02,405 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:02,406 INFO L477 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 38 treesize of output 29 [2018-10-27 04:47:02,406 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,427 INFO L477 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 3 case distinctions, treesize of input 47 treesize of output 57 [2018-10-27 04:47:02,430 INFO L477 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 48 treesize of output 47 [2018-10-27 04:47:02,430 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,461 INFO L477 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 43 treesize of output 48 [2018-10-27 04:47:02,462 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,482 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,508 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:60, output treesize:103 [2018-10-27 04:47:02,603 INFO L477 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 3 case distinctions, treesize of input 162 treesize of output 162 [2018-10-27 04:47:02,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,608 INFO L477 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 155 treesize of output 182 [2018-10-27 04:47:02,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 142 treesize of output 160 [2018-10-27 04:47:02,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,903 INFO L477 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 72 treesize of output 67 [2018-10-27 04:47:02,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,907 INFO L477 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-10-27 04:47:02,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,923 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,026 INFO L477 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 68 treesize of output 63 [2018-10-27 04:47:03,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,041 INFO L477 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-10-27 04:47:03,041 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,056 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,163 INFO L477 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 152 treesize of output 143 [2018-10-27 04:47:03,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 130 treesize of output 142 [2018-10-27 04:47:03,181 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:03,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,287 INFO L477 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 135 treesize of output 162 [2018-10-27 04:47:03,287 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,331 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:03,335 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 86 [2018-10-27 04:47:03,338 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2018-10-27 04:47:03,342 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,356 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:03,408 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:235, output treesize:267 [2018-10-27 04:47:03,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,532 INFO L477 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 150 treesize of output 144 [2018-10-27 04:47:03,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:291, output treesize:144 [2018-10-27 04:47:03,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,875 INFO L477 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-10-27 04:47:03,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-10-27 04:47:03,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:03,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:141 [2018-10-27 04:47:04,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 130 [2018-10-27 04:47:04,184 INFO L477 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 130 treesize of output 129 [2018-10-27 04:47:04,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,247 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:04,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 139 [2018-10-27 04:47:04,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:47:04,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:04,395 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 119 [2018-10-27 04:47:04,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:04,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:04,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:04,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 90 [2018-10-27 04:47:04,404 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,442 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 119 [2018-10-27 04:47:04,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:04,447 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:04,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 76 [2018-10-27 04:47:04,450 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,467 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 168 [2018-10-27 04:47:04,516 INFO L477 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 159 treesize of output 158 [2018-10-27 04:47:04,516 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:04,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 168 [2018-10-27 04:47:04,597 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-27 04:47:04,665 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:04,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-27 04:47:04,743 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:170, output treesize:339 [2018-10-27 04:47:04,895 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:04,897 INFO L477 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 155 treesize of output 141 [2018-10-27 04:47:04,900 INFO L477 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 36 treesize of output 21 [2018-10-27 04:47:04,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 181 [2018-10-27 04:47:05,101 INFO L477 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 181 treesize of output 180 [2018-10-27 04:47:05,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,334 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:05,335 INFO L477 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 124 treesize of output 107 [2018-10-27 04:47:05,337 INFO L477 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 36 treesize of output 21 [2018-10-27 04:47:05,337 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,352 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,465 INFO L477 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 155 treesize of output 138 [2018-10-27 04:47:05,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:05,469 INFO L477 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 36 treesize of output 63 [2018-10-27 04:47:05,469 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,493 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 186 [2018-10-27 04:47:05,618 INFO L477 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 177 treesize of output 176 [2018-10-27 04:47:05,619 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,715 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,805 INFO L477 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 145 treesize of output 131 [2018-10-27 04:47:05,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:05,832 INFO L477 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 36 treesize of output 63 [2018-10-27 04:47:05,832 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,866 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:05,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-10-27 04:47:05,936 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:481, output treesize:391 [2018-10-27 04:47:06,115 INFO L477 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 111 treesize of output 93 [2018-10-27 04:47:06,117 INFO L477 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 1 [2018-10-27 04:47:06,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:06,136 INFO L477 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 43 treesize of output 31 [2018-10-27 04:47:06,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,197 INFO L477 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 153 treesize of output 134 [2018-10-27 04:47:06,200 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:06,200 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-10-27 04:47:06,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:06,224 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 04:47:06,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,279 INFO L477 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 78 treesize of output 64 [2018-10-27 04:47:06,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:06,282 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-10-27 04:47:06,282 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,297 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:06,297 INFO L477 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 24 treesize of output 16 [2018-10-27 04:47:06,298 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,307 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,336 INFO L477 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 67 treesize of output 60 [2018-10-27 04:47:06,338 INFO L477 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-10-27 04:47:06,338 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,352 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:06,352 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-10-27 04:47:06,353 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,362 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:06,383 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:265, output treesize:14 [2018-10-27 04:47:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 19 refuted. 11 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:47:06,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-10-27 04:47:06,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-27 04:47:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-27 04:47:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2023, Unknown=15, NotChecked=0, Total=2162 [2018-10-27 04:47:06,469 INFO L87 Difference]: Start difference. First operand 205 states and 219 transitions. Second operand 47 states. [2018-10-27 04:47:07,859 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2018-10-27 04:47:08,167 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-10-27 04:47:09,230 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 71 [2018-10-27 04:47:09,624 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 92 [2018-10-27 04:47:10,095 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 54 [2018-10-27 04:47:10,406 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 97 [2018-10-27 04:47:10,682 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 69 [2018-10-27 04:47:10,884 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 51 [2018-10-27 04:47:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:12,541 INFO L93 Difference]: Finished difference Result 300 states and 315 transitions. [2018-10-27 04:47:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 04:47:12,543 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2018-10-27 04:47:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:12,544 INFO L225 Difference]: With dead ends: 300 [2018-10-27 04:47:12,544 INFO L226 Difference]: Without dead ends: 300 [2018-10-27 04:47:12,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=659, Invalid=5173, Unknown=20, NotChecked=0, Total=5852 [2018-10-27 04:47:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-27 04:47:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 205. [2018-10-27 04:47:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 04:47:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-10-27 04:47:12,554 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 72 [2018-10-27 04:47:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:12,555 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-10-27 04:47:12,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-27 04:47:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-10-27 04:47:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 04:47:12,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:12,562 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-10-27 04:47:12,562 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:47:12,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1285862792, now seen corresponding path program 1 times [2018-10-27 04:47:12,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:12,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:12,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:12,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:12,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:13,159 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2018-10-27 04:47:13,777 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-27 04:47:13,949 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-10-27 04:47:14,285 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-10-27 04:47:15,077 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-10-27 04:47:17,068 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 147 DAG size of output: 141 [2018-10-27 04:47:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:17,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:17,969 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:17,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:18,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:18,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,319 INFO L477 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 17 treesize of output 21 [2018-10-27 04:47:18,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-10-27 04:47:18,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:47:18,441 INFO L477 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-10-27 04:47:18,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:47:18,456 INFO L477 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-10-27 04:47:18,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,468 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-10-27 04:47:18,537 INFO L477 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 21 treesize of output 16 [2018-10-27 04:47:18,543 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,544 INFO L477 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 16 treesize of output 23 [2018-10-27 04:47:18,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,567 INFO L477 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 21 treesize of output 16 [2018-10-27 04:47:18,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,569 INFO L477 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 16 treesize of output 23 [2018-10-27 04:47:18,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-10-27 04:47:19,579 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2018-10-27 04:47:19,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-27 04:47:19,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-10-27 04:47:19,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-10-27 04:47:19,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:47:19,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-10-27 04:47:19,720 INFO L477 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-10-27 04:47:19,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,724 INFO L477 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-10-27 04:47:19,724 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,733 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,751 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 64 [2018-10-27 04:47:19,822 INFO L477 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 13 treesize of output 16 [2018-10-27 04:47:19,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,826 INFO L477 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 16 treesize of output 23 [2018-10-27 04:47:19,826 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,833 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 79 [2018-10-27 04:47:19,859 INFO L477 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 19 treesize of output 22 [2018-10-27 04:47:19,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,863 INFO L477 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 22 treesize of output 35 [2018-10-27 04:47:19,864 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,872 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,886 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,896 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:19,934 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:160, output treesize:183 [2018-10-27 04:47:20,698 WARN L854 $PredicateComparison]: unable to prove that (exists ((append_~node~0.offset Int) (|append_#t~mem6.offset| Int) (append_~node~0.base Int) (|append_#t~mem7.offset| Int) (|append_#t~mem6.base| Int)) (let ((.cse5 (+ append_~node~0.offset 1)) (.cse6 (+ append_~node~0.offset 5))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~node~0.base) .cse5 |append_#t~mem6.base|) .cse6 0))) (.cse1 (+ |c_append_#in~head.offset| 4))) (let ((.cse3 (select (select .cse8 |c_append_#in~head.base|) .cse1)) (.cse4 (+ |append_#t~mem7.offset| 5))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (let ((.cse0 (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| append_~node~0.base) .cse5 |append_#t~mem6.offset|) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 append_~node~0.offset))))) (store .cse0 |c_append_#in~head.base| (store (select .cse0 |c_append_#in~head.base|) .cse1 append_~node~0.offset))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse7 (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 append_~node~0.base)))) (store .cse7 |c_append_#in~head.base| (store (select .cse7 |c_append_#in~head.base|) .cse1 append_~node~0.base))))))))) is different from true [2018-10-27 04:47:21,462 WARN L179 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 98 [2018-10-27 04:47:21,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,490 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-10-27 04:47:21,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:21,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,689 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:21,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 313 [2018-10-27 04:47:22,017 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2018-10-27 04:47:22,021 INFO L477 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-10-27 04:47:22,029 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,035 INFO L477 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-10-27 04:47:22,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,211 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,252 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:22,437 INFO L303 Elim1Store]: Index analysis took 269 ms [2018-10-27 04:47:22,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 320 [2018-10-27 04:47:22,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 100 [2018-10-27 04:47:22,477 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 04:47:22,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 265 [2018-10-27 04:47:22,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:22,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 193 [2018-10-27 04:47:22,687 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,751 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,784 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 267 [2018-10-27 04:47:22,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,805 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:22,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 208 [2018-10-27 04:47:22,806 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,870 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,900 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 265 [2018-10-27 04:47:22,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,922 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:22,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 193 [2018-10-27 04:47:22,924 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,986 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,205 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:23,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:23,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 266 [2018-10-27 04:47:23,717 INFO L477 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 25 treesize of output 28 [2018-10-27 04:47:23,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:23,725 INFO L477 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 28 treesize of output 47 [2018-10-27 04:47:23,726 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,737 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 219 [2018-10-27 04:47:23,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:23,847 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:23,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 86 [2018-10-27 04:47:23,852 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 202 [2018-10-27 04:47:23,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:23,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:23,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:23,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-10-27 04:47:23,939 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,972 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,989 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,028 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 272 [2018-10-27 04:47:24,067 INFO L477 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 25 treesize of output 28 [2018-10-27 04:47:24,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,104 INFO L477 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 28 treesize of output 47 [2018-10-27 04:47:24,104 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,116 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 225 [2018-10-27 04:47:24,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 100 [2018-10-27 04:47:24,245 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-10-27 04:47:24,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 215 [2018-10-27 04:47:24,363 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:24,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-10-27 04:47:24,369 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,403 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 221 [2018-10-27 04:47:24,428 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,430 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:24,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 88 treesize of output 88 [2018-10-27 04:47:24,434 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,471 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 215 [2018-10-27 04:47:24,496 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,498 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:24,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-10-27 04:47:24,502 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,538 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,610 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:24,709 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:24,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 266 [2018-10-27 04:47:24,747 INFO L477 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 25 treesize of output 28 [2018-10-27 04:47:24,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,756 INFO L477 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 28 treesize of output 47 [2018-10-27 04:47:24,756 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,767 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 219 [2018-10-27 04:47:24,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,881 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:24,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 86 [2018-10-27 04:47:24,885 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 202 [2018-10-27 04:47:24,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:24,953 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:24,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-10-27 04:47:24,958 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:24,992 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,012 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,051 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-10-27 04:47:25,232 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 11 variables, input treesize:542, output treesize:821 [2018-10-27 04:47:25,638 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-10-27 04:47:26,048 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-10-27 04:47:26,458 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-10-27 04:47:26,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 228 [2018-10-27 04:47:26,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:26,568 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:47:26,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,614 INFO L477 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 13 treesize of output 1 [2018-10-27 04:47:26,615 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:26,655 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-10-27 04:47:26,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:26,691 INFO L477 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 114 treesize of output 104 [2018-10-27 04:47:26,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:26,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:26,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 226 [2018-10-27 04:47:26,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:26,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 94 treesize of output 68 [2018-10-27 04:47:26,881 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 95 [2018-10-27 04:47:26,926 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:26,967 INFO L477 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 1 [2018-10-27 04:47:26,967 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,002 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:47:27,002 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,031 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:27,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 224 [2018-10-27 04:47:27,167 INFO L477 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 1 [2018-10-27 04:47:27,168 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,217 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:47:27,218 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-10-27 04:47:27,262 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:27,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 76 [2018-10-27 04:47:27,317 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:27,367 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:27,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 89 [2018-10-27 04:47:27,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,537 INFO L477 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 36 treesize of output 32 [2018-10-27 04:47:27,537 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:27,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-27 04:47:27,569 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:27,594 INFO L477 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-10-27 04:47:27,594 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,616 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:47:27,616 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,632 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 118 [2018-10-27 04:47:27,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,778 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:47:27,778 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,815 INFO L477 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 50 treesize of output 37 [2018-10-27 04:47:27,815 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:27,846 INFO L477 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 1 [2018-10-27 04:47:27,846 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,881 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:47:27,881 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,901 INFO L267 ElimStorePlain]: Start of recursive call 22: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 102 [2018-10-27 04:47:27,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,914 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:47:27,914 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,946 INFO L477 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 1 [2018-10-27 04:47:27,946 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-10-27 04:47:27,973 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:27,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,995 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:47:27,996 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,012 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 109 [2018-10-27 04:47:28,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-10-27 04:47:28,106 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,128 INFO L477 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-10-27 04:47:28,128 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:28,149 INFO L477 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 24 treesize of output 17 [2018-10-27 04:47:28,149 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:28,163 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-27 04:47:28,163 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,173 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:28,231 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 22 variables, input treesize:863, output treesize:7 [2018-10-27 04:47:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-10-27 04:47:28,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:28,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 59 [2018-10-27 04:47:28,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-27 04:47:28,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-27 04:47:28,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3071, Unknown=22, NotChecked=112, Total=3422 [2018-10-27 04:47:28,432 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 59 states. [2018-10-27 04:47:30,205 WARN L179 SmtUtils]: Spent 804.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-10-27 04:47:32,476 WARN L179 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-10-27 04:47:36,202 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-10-27 04:47:39,978 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-10-27 04:47:41,598 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2018-10-27 04:47:45,152 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 181 DAG size of output: 100 [2018-10-27 04:47:48,248 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 182 [2018-10-27 04:47:49,410 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 178 [2018-10-27 04:47:49,888 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 182 [2018-10-27 04:47:50,622 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 193 [2018-10-27 04:47:51,442 WARN L179 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 199 [2018-10-27 04:47:52,269 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 204 [2018-10-27 04:47:53,107 WARN L179 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 205 [2018-10-27 04:47:53,939 WARN L179 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 200 [2018-10-27 04:47:57,206 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-10-27 04:48:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:07,173 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-10-27 04:48:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-27 04:48:07,175 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 74 [2018-10-27 04:48:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:07,177 INFO L225 Difference]: With dead ends: 305 [2018-10-27 04:48:07,177 INFO L226 Difference]: Without dead ends: 305 [2018-10-27 04:48:07,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2246 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=799, Invalid=8338, Unknown=179, NotChecked=190, Total=9506 [2018-10-27 04:48:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-27 04:48:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 232. [2018-10-27 04:48:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-27 04:48:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2018-10-27 04:48:07,195 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 74 [2018-10-27 04:48:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:07,196 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2018-10-27 04:48:07,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-27 04:48:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2018-10-27 04:48:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-27 04:48:07,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:07,197 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:07,197 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-10-27 04:48:07,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1124830539, now seen corresponding path program 2 times [2018-10-27 04:48:07,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:48:07,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:48:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:08,634 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-10-27 04:48:09,965 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2018-10-27 04:48:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:48:11,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:48:11,086 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:48:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:48:11,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:48:11,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:48:11,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:11,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:11,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:11,238 INFO L477 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-10-27 04:48:11,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:11,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:11,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-27 04:48:11,425 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:11,427 INFO L477 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 10 treesize of output 9 [2018-10-27 04:48:11,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:11,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:11,441 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:11,442 INFO L477 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 10 treesize of output 9 [2018-10-27 04:48:11,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:11,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:11,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:11,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-10-27 04:48:11,904 WARN L854 $PredicateComparison]: unable to prove that (exists ((append_~head.offset Int) (append_~node~0.offset Int) (append_~node~0.base Int)) (let ((.cse1 (+ append_~node~0.offset 1)) (.cse2 (+ append_~node~0.offset 5)) (.cse3 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c_append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~head.base|) append_~head.offset append_~node~0.offset) .cse3 append_~node~0.offset)))) (store .cse0 append_~node~0.base (store (store (select .cse0 append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c_append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_append_#in~head.base|) append_~head.offset append_~node~0.base) .cse3 append_~node~0.base)))) (store .cse4 append_~node~0.base (store (store (select .cse4 append_~node~0.base) .cse1 0) .cse2 0)))) (= (store |c_old(#valid)| append_~node~0.base 1) |c_#valid|)))) is different from true [2018-10-27 04:48:12,075 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 04:48:12,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,089 INFO L477 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 17 treesize of output 21 [2018-10-27 04:48:12,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,262 INFO L477 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 52 treesize of output 54 [2018-10-27 04:48:12,266 INFO L477 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 38 treesize of output 37 [2018-10-27 04:48:12,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-10-27 04:48:12,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,332 INFO L477 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 44 treesize of output 44 [2018-10-27 04:48:12,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 04:48:12,375 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:48:12,376 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:12,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-10-27 04:48:12,432 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,474 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 55 [2018-10-27 04:48:12,500 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:12,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,562 INFO L477 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 30 treesize of output 55 [2018-10-27 04:48:12,562 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,636 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:12,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:12,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:12,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2018-10-27 04:48:12,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-10-27 04:48:12,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:12,802 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,813 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-10-27 04:48:12,860 INFO L477 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-10-27 04:48:12,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:12,866 INFO L477 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-10-27 04:48:12,866 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,875 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,893 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,912 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2018-10-27 04:48:13,086 INFO L477 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 13 treesize of output 16 [2018-10-27 04:48:13,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,092 INFO L477 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 16 treesize of output 23 [2018-10-27 04:48:13,092 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,100 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-10-27 04:48:13,129 INFO L477 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-10-27 04:48:13,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,135 INFO L477 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-10-27 04:48:13,135 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,143 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,156 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,169 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,179 INFO L477 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 52 treesize of output 54 [2018-10-27 04:48:13,183 INFO L477 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 38 treesize of output 37 [2018-10-27 04:48:13,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,190 INFO L477 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 37 treesize of output 41 [2018-10-27 04:48:13,190 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,202 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,227 INFO L477 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 44 treesize of output 44 [2018-10-27 04:48:13,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 04:48:13,255 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,258 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:13,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2018-10-27 04:48:13,261 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,332 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 55 [2018-10-27 04:48:13,359 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:13,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,406 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:13,412 INFO L477 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 30 treesize of output 55 [2018-10-27 04:48:13,413 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,452 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:13,489 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:13,535 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:13,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 13 xjuncts. [2018-10-27 04:48:13,669 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 6 variables, input treesize:130, output treesize:1532 [2018-10-27 04:48:14,165 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 68 [2018-10-27 04:48:22,936 WARN L179 SmtUtils]: Spent 7.94 s on a formula simplification that was a NOOP. DAG size: 195 [2018-10-27 04:48:22,945 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 287 [2018-10-27 04:48:22,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,963 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,972 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 264 [2018-10-27 04:48:22,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:31,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:31,603 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:31,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:31,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 194 [2018-10-27 04:48:31,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:31,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:31,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:31,620 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:31,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 212 [2018-10-27 04:48:31,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 183 [2018-10-27 04:48:39,662 INFO L477 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 11 treesize of output 14 [2018-10-27 04:48:39,670 INFO L477 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 14 treesize of output 15 [2018-10-27 04:48:39,670 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,683 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 109 [2018-10-27 04:48:39,847 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:48:39,847 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:42,412 INFO L477 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 73 treesize of output 72 [2018-10-27 04:48:42,412 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:44,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:44,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 75 [2018-10-27 04:48:44,446 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:46,467 INFO L477 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 66 treesize of output 67 [2018-10-27 04:48:46,467 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 72 [2018-10-27 04:48:48,470 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:48,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-10-27 04:48:48,476 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,508 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,723 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:49,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 94 [2018-10-27 04:48:49,765 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-10-27 04:48:51,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 80 [2018-10-27 04:48:51,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:51,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-10-27 04:48:51,441 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:51,476 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-10-27 04:48:52,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:52,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-10-27 04:48:52,031 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,064 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 89 [2018-10-27 04:48:52,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:52,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 106 [2018-10-27 04:48:52,527 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,629 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 88 [2018-10-27 04:48:52,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:52,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 88 [2018-10-27 04:48:52,940 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,024 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,073 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,135 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 197 [2018-10-27 04:48:53,341 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-10-27 04:48:53,345 INFO L477 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 39 treesize of output 38 [2018-10-27 04:48:53,352 INFO L477 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 38 treesize of output 38 [2018-10-27 04:48:53,352 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,367 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 73 [2018-10-27 04:48:53,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-10-27 04:48:53,481 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:53,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 67 [2018-10-27 04:48:53,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:53,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-10-27 04:48:53,558 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,585 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 69 [2018-10-27 04:48:53,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:53,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-10-27 04:48:53,611 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,637 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,691 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:48:53,775 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:48:59,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 160 [2018-10-27 04:48:59,094 INFO L477 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 11 treesize of output 14 [2018-10-27 04:48:59,099 INFO L477 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 14 treesize of output 15 [2018-10-27 04:48:59,099 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,107 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 109 [2018-10-27 04:48:59,225 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:48:59,225 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:00,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:00,412 INFO L477 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 4 case distinctions, treesize of input 64 treesize of output 91 [2018-10-27 04:49:00,413 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:01,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2018-10-27 04:49:01,662 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:02,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 75 [2018-10-27 04:49:02,894 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:04,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 93 [2018-10-27 04:49:04,500 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:04,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 143 [2018-10-27 04:49:04,556 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 8 xjuncts. [2018-10-27 04:49:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:04,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 66 treesize of output 126 [2018-10-27 04:49:04,901 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 16 xjuncts. [2018-10-27 04:49:05,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:05,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 111 [2018-10-27 04:49:05,181 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-10-27 04:49:05,410 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-10-27 04:49:07,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 92 [2018-10-27 04:49:07,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:07,834 INFO L477 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 4 case distinctions, treesize of input 81 treesize of output 108 [2018-10-27 04:49:07,835 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:07,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:07,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 111 [2018-10-27 04:49:07,998 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 8 xjuncts. [2018-10-27 04:49:08,127 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:09,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-10-27 04:49:09,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:09,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 129 [2018-10-27 04:49:09,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:49:09,383 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 64 xjuncts. [2018-10-27 04:49:10,074 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 26 xjuncts. [2018-10-27 04:49:12,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 72 [2018-10-27 04:49:12,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:12,450 INFO L477 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-27 04:49:12,451 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:12,494 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:12,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2018-10-27 04:49:12,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:12,523 INFO L477 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-27 04:49:12,523 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:12,567 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:13,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 77 [2018-10-27 04:49:13,034 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:13,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2018-10-27 04:49:13,769 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:13,782 INFO L477 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 2 case distinctions, treesize of input 25 treesize of output 44 [2018-10-27 04:49:13,783 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:13,819 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:13,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2018-10-27 04:49:13,837 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:13,850 INFO L477 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 2 case distinctions, treesize of input 25 treesize of output 44 [2018-10-27 04:49:13,850 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:13,888 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:14,248 INFO L267 ElimStorePlain]: Start of recursive call 37: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:49:14,458 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:49:14,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 160 [2018-10-27 04:49:14,572 INFO L477 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 39 treesize of output 38 [2018-10-27 04:49:14,577 INFO L477 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 38 treesize of output 38 [2018-10-27 04:49:14,577 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,587 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 73 [2018-10-27 04:49:14,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:14,675 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:14,680 INFO L477 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 21 treesize of output 28 [2018-10-27 04:49:14,680 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2018-10-27 04:49:14,713 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:14,730 INFO L477 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-27 04:49:14,731 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:14,771 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:14,814 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:14,880 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:14,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 162 [2018-10-27 04:49:14,995 INFO L477 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 39 treesize of output 38 [2018-10-27 04:49:15,000 INFO L477 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 38 treesize of output 38 [2018-10-27 04:49:15,000 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:15,009 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:15,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 73 [2018-10-27 04:49:15,090 INFO L477 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 4 case distinctions, treesize of input 21 treesize of output 36 [2018-10-27 04:49:15,090 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:15,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 67 [2018-10-27 04:49:15,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:15,190 INFO L477 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-27 04:49:15,190 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:15,256 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:15,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 69 [2018-10-27 04:49:15,273 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:15,291 INFO L477 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-27 04:49:15,292 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:15,338 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:15,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 67 [2018-10-27 04:49:15,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:15,372 INFO L477 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-27 04:49:15,372 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:15,418 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:15,552 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-10-27 04:49:15,707 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-10-27 04:49:20,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 282 treesize of output 272 [2018-10-27 04:49:25,128 WARN L179 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 162 DAG size of output: 149 [2018-10-27 04:49:25,133 INFO L477 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 257 treesize of output 256 [2018-10-27 04:49:25,140 INFO L477 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 38 treesize of output 38 [2018-10-27 04:49:25,140 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:25,213 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:27,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:27,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 249 treesize of output 259 [2018-10-27 04:49:27,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:27,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:27,510 INFO L477 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 247 treesize of output 262 [2018-10-27 04:49:27,511 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:28,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:28,520 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:28,527 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 243 [2018-10-27 04:49:28,528 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:29,145 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:29,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 245 treesize of output 262 [2018-10-27 04:49:29,203 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:30,726 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-10-27 04:49:36,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 264 [2018-10-27 04:49:36,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-10-27 04:49:36,053 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:36,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 155 [2018-10-27 04:49:36,210 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:36,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:36,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 133 treesize of output 190 [2018-10-27 04:49:36,273 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 16 xjuncts. [2018-10-27 04:49:36,730 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:36,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 118 treesize of output 139 [2018-10-27 04:49:36,754 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:37,027 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:37,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 157 [2018-10-27 04:49:37,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:37,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 148 treesize of output 169 [2018-10-27 04:49:37,102 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:37,422 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:37,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:37,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 107 treesize of output 164 [2018-10-27 04:49:37,488 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 16 xjuncts. [2018-10-27 04:49:37,889 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:38,394 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:49:46,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 261 [2018-10-27 04:49:46,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:46,270 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:46,271 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_276 term size 56 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) 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.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-10-27 04:49:46,274 INFO L168 Benchmark]: Toolchain (without parser) took 267741.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.9 MB). Free memory was 957.0 MB in the beginning and 1.2 GB in the end (delta: -245.7 MB). Peak memory consumption was 353.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:49:46,275 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:49:46,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.21 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 934.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:49:46,280 INFO L168 Benchmark]: Boogie Preprocessor took 132.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -221.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:49:46,281 INFO L168 Benchmark]: RCFGBuilder took 968.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:49:46,281 INFO L168 Benchmark]: TraceAbstraction took 266239.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.6 MB). Peak memory consumption was 332.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:49:46,282 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.21 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 934.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -221.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 968.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 266239.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.6 MB). Peak memory consumption was 332.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_276 term size 56 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_276 term size 56: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:49:48,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:49:48,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:49:48,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:49:48,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:49:48,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:49:48,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:49:48,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:49:48,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:49:48,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:49:48,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:49:48,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:49:48,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:49:48,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:49:48,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:49:48,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:49:48,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:49:48,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:49:48,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:49:48,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:49:48,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:49:48,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:49:48,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:49:48,293 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:49:48,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:49:48,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:49:48,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:49:48,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:49:48,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:49:48,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:49:48,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:49:48,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:49:48,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:49:48,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:49:48,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:49:48,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:49:48,301 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-10-27 04:49:48,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:49:48,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:49:48,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:49:48,315 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:49:48,316 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:49:48,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:49:48,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:49:48,316 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:49:48,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:49:48,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:49:48,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:49:48,317 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:49:48,317 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:49:48,317 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:49:48,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:49:48,318 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-27 04:49:48,318 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-27 04:49:48,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:49:48,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:49:48,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:49:48,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:49:48,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:49:48,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:49:48,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:49:48,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:49:48,322 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-27 04:49:48,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:49:48,322 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-27 04:49:48,322 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 2552da43a16cb54d5090a24426eb170717bf5525 [2018-10-27 04:49:48,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:49:48,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:49:48,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:49:48,377 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:49:48,377 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:49:48,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-10-27 04:49:48,430 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/31084aaf6/1e3600c976db48bc9756dcb4152af75c/FLAG34af701fa [2018-10-27 04:49:48,868 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:49:48,869 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-10-27 04:49:48,883 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/31084aaf6/1e3600c976db48bc9756dcb4152af75c/FLAG34af701fa [2018-10-27 04:49:48,899 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/data/31084aaf6/1e3600c976db48bc9756dcb4152af75c [2018-10-27 04:49:48,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:49:48,907 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:49:48,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:49:48,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:49:48,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:49:48,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:49:48" (1/1) ... [2018-10-27 04:49:48,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24472292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:48, skipping insertion in model container [2018-10-27 04:49:48,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:49:48" (1/1) ... [2018-10-27 04:49:48,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:49:48,965 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:49:49,315 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:49:49,335 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:49:49,409 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:49:49,464 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:49:49,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49 WrapperNode [2018-10-27 04:49:49,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:49:49,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:49:49,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:49:49,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:49:49,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... [2018-10-27 04:49:49,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... [2018-10-27 04:49:49,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... [2018-10-27 04:49:49,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... [2018-10-27 04:49:49,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... [2018-10-27 04:49:49,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... [2018-10-27 04:49:49,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... [2018-10-27 04:49:49,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:49:49,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:49:49,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:49:49,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:49:49,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:49:49,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:49:49,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:49:49,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-27 04:49:49,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-27 04:49:49,678 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-10-27 04:49:49,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:49:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 04:49:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 04:49:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 04:49:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 04:49:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 04:49:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 04:49:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 04:49:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 04:49:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 04:49:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 04:49:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 04:49:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 04:49:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 04:49:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 04:49:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 04:49:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 04:49:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 04:49:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-27 04:49:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-27 04:49:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 04:49:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 04:49:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 04:49:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 04:49:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 04:49:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 04:49:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 04:49:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 04:49:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 04:49:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 04:49:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 04:49:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 04:49:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 04:49:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 04:49:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 04:49:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 04:49:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 04:49:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 04:49:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 04:49:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 04:49:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 04:49:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 04:49:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 04:49:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 04:49:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 04:49:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 04:49:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 04:49:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 04:49:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 04:49:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 04:49:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 04:49:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 04:49:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 04:49:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 04:49:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 04:49:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 04:49:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 04:49:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 04:49:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 04:49:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 04:49:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 04:49:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 04:49:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 04:49:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 04:49:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 04:49:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 04:49:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 04:49:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 04:49:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 04:49:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 04:49:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 04:49:49,697 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 04:49:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 04:49:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 04:49:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 04:49:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 04:49:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 04:49:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 04:49:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 04:49:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 04:49:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 04:49:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 04:49:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 04:49:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 04:49:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 04:49:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 04:49:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 04:49:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 04:49:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 04:49:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 04:49:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 04:49:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 04:49:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 04:49:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 04:49:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 04:49:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 04:49:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 04:49:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 04:49:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 04:49:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 04:49:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-10-27 04:49:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 04:49:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-10-27 04:49:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:49:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-10-27 04:49:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 04:49:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 04:49:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:49:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:49:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:49:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:49:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-10-27 04:49:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-10-27 04:49:51,014 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:49:51,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:49:51 BoogieIcfgContainer [2018-10-27 04:49:51,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:49:51,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:49:51,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:49:51,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:49:51,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:49:48" (1/3) ... [2018-10-27 04:49:51,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766a768c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:49:51, skipping insertion in model container [2018-10-27 04:49:51,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:49:49" (2/3) ... [2018-10-27 04:49:51,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766a768c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:49:51, skipping insertion in model container [2018-10-27 04:49:51,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:49:51" (3/3) ... [2018-10-27 04:49:51,022 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-10-27 04:49:51,033 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:49:51,041 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-10-27 04:49:51,057 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-10-27 04:49:51,083 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:49:51,084 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:49:51,084 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:49:51,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:49:51,085 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:49:51,091 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:49:51,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:49:51,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:49:51,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:49:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2018-10-27 04:49:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:49:51,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:51,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:51,142 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:51,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -957841405, now seen corresponding path program 1 times [2018-10-27 04:49:51,157 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:51,157 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:51,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:51,302 INFO L477 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-10-27 04:49:51,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:49:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:51,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:51,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:49:51,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:49:51,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:49:51,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:49:51,372 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 4 states. [2018-10-27 04:49:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:52,442 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-10-27 04:49:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:49:52,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:49:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:52,456 INFO L225 Difference]: With dead ends: 174 [2018-10-27 04:49:52,457 INFO L226 Difference]: Without dead ends: 171 [2018-10-27 04:49:52,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-27 04:49:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-27 04:49:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 133. [2018-10-27 04:49:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-27 04:49:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-10-27 04:49:52,508 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 8 [2018-10-27 04:49:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:52,509 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-10-27 04:49:52,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:49:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-10-27 04:49:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:49:52,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:52,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:52,510 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:52,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash -957841404, now seen corresponding path program 1 times [2018-10-27 04:49:52,511 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:52,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:52,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:52,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:52,580 INFO L477 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-10-27 04:49:52,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:52,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:52,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:52,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:49:52,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:49:52,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:49:52,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:49:52,706 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 4 states. [2018-10-27 04:49:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:53,038 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2018-10-27 04:49:53,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:49:53,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:49:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:53,041 INFO L225 Difference]: With dead ends: 133 [2018-10-27 04:49:53,041 INFO L226 Difference]: Without dead ends: 133 [2018-10-27 04:49:53,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:49:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-27 04:49:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-27 04:49:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-27 04:49:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2018-10-27 04:49:53,053 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 8 [2018-10-27 04:49:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:53,053 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2018-10-27 04:49:53,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:49:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2018-10-27 04:49:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 04:49:53,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:53,054 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:53,055 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:53,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash 516486408, now seen corresponding path program 1 times [2018-10-27 04:49:53,058 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:53,058 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:53,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:53,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:53,116 INFO L477 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-10-27 04:49:53,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:53,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:53,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:53,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:49:53,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:49:53,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:49:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:49:53,146 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 4 states. [2018-10-27 04:49:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:53,487 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-10-27 04:49:53,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:49:53,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-27 04:49:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:53,491 INFO L225 Difference]: With dead ends: 131 [2018-10-27 04:49:53,491 INFO L226 Difference]: Without dead ends: 131 [2018-10-27 04:49:53,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-10-27 04:49:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-27 04:49:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-10-27 04:49:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-27 04:49:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-10-27 04:49:53,500 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 12 [2018-10-27 04:49:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:53,500 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-10-27 04:49:53,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:49:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-10-27 04:49:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 04:49:53,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:53,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:53,502 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:53,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 516486407, now seen corresponding path program 1 times [2018-10-27 04:49:53,502 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:53,503 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:53,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:53,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:53,575 INFO L477 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 12 treesize of output 11 [2018-10-27 04:49:53,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:53,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-10-27 04:49:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:53,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:53,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:53,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:49:53,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:49:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:49:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:49:53,779 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 5 states. [2018-10-27 04:49:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:54,141 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-10-27 04:49:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:49:54,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-27 04:49:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:54,142 INFO L225 Difference]: With dead ends: 153 [2018-10-27 04:49:54,142 INFO L226 Difference]: Without dead ends: 153 [2018-10-27 04:49:54,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:49:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-27 04:49:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-10-27 04:49:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-27 04:49:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-10-27 04:49:54,153 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 12 [2018-10-27 04:49:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:54,153 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-10-27 04:49:54,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:49:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-10-27 04:49:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:49:54,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:54,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:54,155 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:54,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 171403474, now seen corresponding path program 1 times [2018-10-27 04:49:54,156 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:54,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:54,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:54,252 INFO L477 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-10-27 04:49:54,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:49:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:54,267 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:54,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:54,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:49:54,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:49:54,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:49:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:49:54,271 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 4 states. [2018-10-27 04:49:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:54,713 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-10-27 04:49:54,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:49:54,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-27 04:49:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:54,715 INFO L225 Difference]: With dead ends: 127 [2018-10-27 04:49:54,715 INFO L226 Difference]: Without dead ends: 127 [2018-10-27 04:49:54,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-10-27 04:49:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-27 04:49:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-27 04:49:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-27 04:49:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-10-27 04:49:54,722 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 20 [2018-10-27 04:49:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:54,722 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-10-27 04:49:54,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:49:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-10-27 04:49:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:49:54,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:54,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:54,723 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:54,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 171403475, now seen corresponding path program 1 times [2018-10-27 04:49:54,724 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:54,724 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:54,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:54,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:54,816 INFO L477 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-10-27 04:49:54,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:54,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:54,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:54,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:49:54,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:49:54,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:49:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:49:54,838 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2018-10-27 04:49:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:55,011 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-10-27 04:49:55,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:49:55,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-27 04:49:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:55,014 INFO L225 Difference]: With dead ends: 122 [2018-10-27 04:49:55,014 INFO L226 Difference]: Without dead ends: 122 [2018-10-27 04:49:55,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-10-27 04:49:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-27 04:49:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-10-27 04:49:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-27 04:49:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-10-27 04:49:55,021 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 20 [2018-10-27 04:49:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:55,022 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-10-27 04:49:55,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:49:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-10-27 04:49:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:49:55,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:55,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:55,023 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:55,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:55,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1018540507, now seen corresponding path program 1 times [2018-10-27 04:49:55,025 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:55,025 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:55,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:55,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:55,110 INFO L477 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-10-27 04:49:55,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:49:55,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:55,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:55,134 INFO L477 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 19 treesize of output 23 [2018-10-27 04:49:55,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-10-27 04:49:55,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 04:49:55,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:55,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2018-10-27 04:49:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:55,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:55,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:49:55,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:49:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:49:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:49:55,310 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 9 states. [2018-10-27 04:49:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:56,532 INFO L93 Difference]: Finished difference Result 237 states and 253 transitions. [2018-10-27 04:49:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:49:56,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-10-27 04:49:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:56,534 INFO L225 Difference]: With dead ends: 237 [2018-10-27 04:49:56,534 INFO L226 Difference]: Without dead ends: 237 [2018-10-27 04:49:56,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:49:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-27 04:49:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 149. [2018-10-27 04:49:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-27 04:49:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-10-27 04:49:56,542 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 21 [2018-10-27 04:49:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:56,542 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-10-27 04:49:56,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:49:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-10-27 04:49:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:49:56,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:56,543 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:56,543 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:49:56,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:56,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1018540508, now seen corresponding path program 1 times [2018-10-27 04:49:56,545 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:56,545 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:56,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:56,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:56,676 INFO L477 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-10-27 04:49:56,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,702 INFO L477 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-10-27 04:49:56,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:49:56,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:56,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:56,741 INFO L477 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-10-27 04:49:56,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,753 INFO L477 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 12 treesize of output 15 [2018-10-27 04:49:56,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-10-27 04:49:56,894 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:56,909 INFO L477 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 4 case distinctions, treesize of input 17 treesize of output 28 [2018-10-27 04:49:56,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-10-27 04:49:56,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:56,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:55 [2018-10-27 04:49:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:57,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:49:57,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:49:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:49:57,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:49:57,063 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 10 states. [2018-10-27 04:50:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:01,425 INFO L93 Difference]: Finished difference Result 177 states and 199 transitions. [2018-10-27 04:50:01,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:50:01,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-10-27 04:50:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:01,426 INFO L225 Difference]: With dead ends: 177 [2018-10-27 04:50:01,426 INFO L226 Difference]: Without dead ends: 177 [2018-10-27 04:50:01,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:50:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-27 04:50:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-27 04:50:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-27 04:50:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2018-10-27 04:50:01,440 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 21 [2018-10-27 04:50:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:01,440 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2018-10-27 04:50:01,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:50:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2018-10-27 04:50:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 04:50:01,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:01,441 INFO L375 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-10-27 04:50:01,441 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:50:01,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1907798989, now seen corresponding path program 1 times [2018-10-27 04:50:01,442 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:01,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:01,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:01,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:01,584 INFO L477 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-10-27 04:50:01,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:01,621 INFO L477 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-10-27 04:50:01,624 INFO L477 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-10-27 04:50:01,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,645 INFO L477 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-10-27 04:50:01,648 INFO L477 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-10-27 04:50:01,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-10-27 04:50:01,707 INFO L477 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 21 treesize of output 16 [2018-10-27 04:50:01,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:01,716 INFO L477 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 16 treesize of output 23 [2018-10-27 04:50:01,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,765 INFO L477 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 21 treesize of output 16 [2018-10-27 04:50:01,784 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:01,785 INFO L477 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 16 treesize of output 23 [2018-10-27 04:50:01,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-10-27 04:50:01,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:01,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:01,866 INFO L477 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-10-27 04:50:01,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:40 [2018-10-27 04:50:02,102 INFO L477 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 28 treesize of output 29 [2018-10-27 04:50:02,105 INFO L477 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-10-27 04:50:02,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,155 INFO L477 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 28 treesize of output 29 [2018-10-27 04:50:02,158 INFO L477 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-10-27 04:50:02,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-10-27 04:50:02,237 INFO L477 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 36 [2018-10-27 04:50:02,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:02,243 INFO L477 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 16 treesize of output 23 [2018-10-27 04:50:02,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,303 INFO L477 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 36 [2018-10-27 04:50:02,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:02,309 INFO L477 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 16 treesize of output 23 [2018-10-27 04:50:02,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:02,374 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-10-27 04:50:02,655 INFO L477 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 38 treesize of output 32 [2018-10-27 04:50:02,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:02,660 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-10-27 04:50:02,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,674 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-10-27 04:50:02,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,700 INFO L477 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 38 treesize of output 32 [2018-10-27 04:50:02,703 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-10-27 04:50:02,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,717 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:02,718 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-10-27 04:50:02,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:02,729 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2018-10-27 04:50:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:02,776 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:02,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:02,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-27 04:50:02,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:50:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:50:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:50:02,780 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand 14 states. [2018-10-27 04:50:05,528 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 04:50:05,746 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-10-27 04:50:05,960 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-10-27 04:50:06,157 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-27 04:50:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:09,074 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2018-10-27 04:50:09,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:50:09,074 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-10-27 04:50:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:09,075 INFO L225 Difference]: With dead ends: 175 [2018-10-27 04:50:09,075 INFO L226 Difference]: Without dead ends: 175 [2018-10-27 04:50:09,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-10-27 04:50:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-27 04:50:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-27 04:50:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-27 04:50:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-10-27 04:50:09,080 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 30 [2018-10-27 04:50:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:09,081 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-10-27 04:50:09,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:50:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-10-27 04:50:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:50:09,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:09,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:09,082 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:50:09,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:09,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1805061680, now seen corresponding path program 1 times [2018-10-27 04:50:09,082 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:09,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:09,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:09,228 INFO L477 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-10-27 04:50:09,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:09,252 INFO L477 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 13 treesize of output 10 [2018-10-27 04:50:09,255 INFO L477 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 10 treesize of output 9 [2018-10-27 04:50:09,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,272 INFO L477 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 13 treesize of output 10 [2018-10-27 04:50:09,275 INFO L477 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 10 treesize of output 9 [2018-10-27 04:50:09,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-10-27 04:50:09,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:09,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:09,384 INFO L477 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-10-27 04:50:09,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-10-27 04:50:09,646 INFO L477 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 21 treesize of output 22 [2018-10-27 04:50:09,649 INFO L477 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-10-27 04:50:09,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,678 INFO L477 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 21 treesize of output 22 [2018-10-27 04:50:09,681 INFO L477 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-10-27 04:50:09,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-10-27 04:50:09,746 INFO L477 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 29 [2018-10-27 04:50:09,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:09,751 INFO L477 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 16 treesize of output 23 [2018-10-27 04:50:09,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,798 INFO L477 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 29 [2018-10-27 04:50:09,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:09,803 INFO L477 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 16 treesize of output 23 [2018-10-27 04:50:09,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:09,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:58 [2018-10-27 04:50:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:10,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:10,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:10,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-27 04:50:10,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:50:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:50:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:50:10,383 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 13 states. [2018-10-27 04:50:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:14,114 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2018-10-27 04:50:14,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:50:14,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-10-27 04:50:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:14,116 INFO L225 Difference]: With dead ends: 167 [2018-10-27 04:50:14,116 INFO L226 Difference]: Without dead ends: 167 [2018-10-27 04:50:14,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:50:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-27 04:50:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-27 04:50:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-27 04:50:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-10-27 04:50:14,121 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 32 [2018-10-27 04:50:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:14,122 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-10-27 04:50:14,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:50:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-10-27 04:50:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:50:14,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:14,123 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:14,125 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:50:14,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:14,125 INFO L82 PathProgramCache]: Analyzing trace with hash 928302793, now seen corresponding path program 1 times [2018-10-27 04:50:14,126 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:14,126 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:14,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:14,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:14,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:14,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:50:14,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:50:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:50:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:50:14,315 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 3 states. [2018-10-27 04:50:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:14,349 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-10-27 04:50:14,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:50:14,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-27 04:50:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:14,352 INFO L225 Difference]: With dead ends: 176 [2018-10-27 04:50:14,352 INFO L226 Difference]: Without dead ends: 176 [2018-10-27 04:50:14,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-10-27 04:50:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-27 04:50:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 163. [2018-10-27 04:50:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-27 04:50:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2018-10-27 04:50:14,357 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 37 [2018-10-27 04:50:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:14,357 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2018-10-27 04:50:14,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:50:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2018-10-27 04:50:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 04:50:14,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:14,358 INFO L375 BasicCegarLoop]: trace histogram [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-10-27 04:50:14,359 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:50:14,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:14,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2093243127, now seen corresponding path program 1 times [2018-10-27 04:50:14,361 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:14,361 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:14,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:14,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:14,521 INFO L477 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-10-27 04:50:14,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:14,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:14,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:14,547 INFO L477 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 19 treesize of output 23 [2018-10-27 04:50:14,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:14,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-10-27 04:50:14,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-27 04:50:14,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:14,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-10-27 04:50:14,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:14,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:14,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:14,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 04:50:14,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-27 04:50:14,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:15,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:20 [2018-10-27 04:50:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:15,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:18,253 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-10-27 04:50:18,256 INFO L477 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 21 treesize of output 19 [2018-10-27 04:50:18,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:18,321 INFO L477 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 21 [2018-10-27 04:50:18,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:18,395 INFO L477 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 35 treesize of output 31 [2018-10-27 04:50:18,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:18,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:18,454 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:97, output treesize:68 [2018-10-27 04:50:18,762 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-10-27 04:50:18,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:50:18,766 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:50:18,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:18,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:19,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:19,560 INFO L477 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 12 treesize of output 15 [2018-10-27 04:50:19,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:19,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:19,581 INFO L477 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-10-27 04:50:19,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:19,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-10-27 04:50:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:19,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:20,045 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 04:50:20,169 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,169 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:94, output treesize:1 [2018-10-27 04:50:20,608 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 04:50:21,347 WARN L179 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-10-27 04:50:21,350 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:21,351 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:21,352 INFO L477 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 44 treesize of output 33 [2018-10-27 04:50:21,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,512 INFO L477 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 44 [2018-10-27 04:50:21,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:21,672 INFO L477 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 1 case distinctions, treesize of input 51 treesize of output 55 [2018-10-27 04:50:21,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:21,679 INFO L477 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 50 treesize of output 48 [2018-10-27 04:50:21,680 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:21,887 INFO L477 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 33 treesize of output 31 [2018-10-27 04:50:21,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:22,083 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,083 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,084 INFO L477 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 48 treesize of output 37 [2018-10-27 04:50:22,085 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,102 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 50 treesize of output 39 [2018-10-27 04:50:22,104 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,109 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,111 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-10-27 04:50:22,111 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,299 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:22,300 INFO L477 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 44 treesize of output 33 [2018-10-27 04:50:22,300 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-10-27 04:50:22,472 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:160, output treesize:155 [2018-10-27 04:50:22,938 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2018-10-27 04:50:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:23,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:50:23,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 7] total 28 [2018-10-27 04:50:23,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 04:50:23,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 04:50:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=756, Unknown=7, NotChecked=0, Total=870 [2018-10-27 04:50:23,013 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 29 states. [2018-10-27 04:50:24,285 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 04:50:25,266 WARN L179 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2018-10-27 04:50:29,402 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2018-10-27 04:50:38,344 WARN L179 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2018-10-27 04:50:40,800 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2018-10-27 04:50:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:47,715 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-10-27 04:50:47,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:50:47,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-10-27 04:50:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:47,718 INFO L225 Difference]: With dead ends: 189 [2018-10-27 04:50:47,718 INFO L226 Difference]: Without dead ends: 189 [2018-10-27 04:50:47,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=255, Invalid=1456, Unknown=11, NotChecked=0, Total=1722 [2018-10-27 04:50:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-27 04:50:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2018-10-27 04:50:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-27 04:50:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2018-10-27 04:50:47,723 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 40 [2018-10-27 04:50:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:47,723 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2018-10-27 04:50:47,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 04:50:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2018-10-27 04:50:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 04:50:47,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:47,724 INFO L375 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-10-27 04:50:47,725 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:50:47,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash -767275208, now seen corresponding path program 1 times [2018-10-27 04:50:47,726 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:47,726 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:47,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:47,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:47,880 INFO L477 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 12 treesize of output 11 [2018-10-27 04:50:47,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:47,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:47,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-10-27 04:50:47,952 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc2.base| (_ bv1 1))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-10-27 04:50:47,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:47,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:47,985 INFO L477 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 19 treesize of output 23 [2018-10-27 04:50:47,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:47,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:47,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-10-27 04:50:48,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:48,285 INFO L477 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 20 treesize of output 20 [2018-10-27 04:50:48,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:48,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:48,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-10-27 04:50:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-27 04:50:48,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:48,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:50:48,494 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:50:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:48,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:48,544 INFO L477 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-10-27 04:50:48,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:48,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:48,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:50:48,720 INFO L477 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 14 treesize of output 11 [2018-10-27 04:50:48,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:48,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:48,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-10-27 04:50:48,810 INFO L477 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 14 treesize of output 11 [2018-10-27 04:50:48,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:48,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:48,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-10-27 04:50:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:48,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:48,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:50:48,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 19 [2018-10-27 04:50:48,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 04:50:48,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 04:50:48,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=293, Unknown=11, NotChecked=36, Total=420 [2018-10-27 04:50:48,994 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand 20 states. [2018-10-27 04:50:52,206 WARN L179 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-10-27 04:50:52,829 WARN L179 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2018-10-27 04:50:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:54,332 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2018-10-27 04:50:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:50:54,332 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-10-27 04:50:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:54,334 INFO L225 Difference]: With dead ends: 218 [2018-10-27 04:50:54,334 INFO L226 Difference]: Without dead ends: 218 [2018-10-27 04:50:54,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 109 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=204, Invalid=716, Unknown=14, NotChecked=58, Total=992 [2018-10-27 04:50:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-27 04:50:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 158. [2018-10-27 04:50:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-27 04:50:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2018-10-27 04:50:54,338 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 42 [2018-10-27 04:50:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:54,338 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2018-10-27 04:50:54,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 04:50:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2018-10-27 04:50:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 04:50:54,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:54,341 INFO L375 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-10-27 04:50:54,341 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:50:54,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash -767275207, now seen corresponding path program 1 times [2018-10-27 04:50:54,342 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:54,342 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:54,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:54,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:54,492 INFO L477 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-10-27 04:50:54,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,501 INFO L477 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-10-27 04:50:54,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:50:54,923 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_#t~malloc2.base| (_ bv9 32))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-10-27 04:50:54,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-10-27 04:50:55,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,090 INFO L477 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-10-27 04:50:55,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:55,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 04:50:55,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,201 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-10-27 04:50:55,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:55,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:55,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:41 [2018-10-27 04:50:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-27 04:50:55,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:57,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:50:57,298 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:50:57,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:57,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:57,344 INFO L477 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-10-27 04:50:57,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,352 INFO L477 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-10-27 04:50:57,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:50:57,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:57,373 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:57,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-10-27 04:50:57,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:57,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:57,391 INFO L477 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-10-27 04:50:57,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:57,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 04:50:57,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:57,428 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:57,438 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-10-27 04:50:57,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:57,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:57,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:38 [2018-10-27 04:50:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-10-27 04:50:57,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:59,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:50:59,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2018-10-27 04:50:59,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:50:59,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:50:59,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2018-10-27 04:50:59,869 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 12 states. [2018-10-27 04:51:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:01,553 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-10-27 04:51:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:51:01,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-27 04:51:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:01,555 INFO L225 Difference]: With dead ends: 195 [2018-10-27 04:51:01,556 INFO L226 Difference]: Without dead ends: 195 [2018-10-27 04:51:01,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=74, Invalid=309, Unknown=1, NotChecked=36, Total=420 [2018-10-27 04:51:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-27 04:51:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2018-10-27 04:51:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-27 04:51:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2018-10-27 04:51:01,562 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 42 [2018-10-27 04:51:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:01,562 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2018-10-27 04:51:01,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:51:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2018-10-27 04:51:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:51:01,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:01,565 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:51:01,565 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-10-27 04:51:01,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:01,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1478165312, now seen corresponding path program 1 times [2018-10-27 04:51:01,566 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:01,566 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:01,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:01,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:01,836 INFO L477 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-10-27 04:51:01,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:01,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:01,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:51:01,858 INFO L477 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 14 treesize of output 11 [2018-10-27 04:51:01,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:01,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:01,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2018-10-27 04:51:01,943 INFO L477 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 13 treesize of output 10 [2018-10-27 04:51:01,946 INFO L477 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 10 treesize of output 9 [2018-10-27 04:51:01,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:01,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:01,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:01,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-10-27 04:51:02,044 INFO L477 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 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:51:02,048 INFO L477 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 24 treesize of output 23 [2018-10-27 04:51:02,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:03,204 INFO L477 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 21 treesize of output 30 [2018-10-27 04:51:03,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:51:03,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:51:03,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:51:03,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:41, output treesize:76 [2018-10-27 04:51:03,426 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-10-27 04:51:03,479 INFO L477 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 71 treesize of output 68 [2018-10-27 04:51:03,485 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:03,486 INFO L477 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 64 treesize of output 79 [2018-10-27 04:51:03,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:03,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:09,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 55 [2018-10-27 04:51:09,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:51:09,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:51:09,761 INFO L477 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 34 treesize of output 29 [2018-10-27 04:51:09,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:09,767 INFO L477 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-10-27 04:51:09,767 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:09,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:09,882 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 3 xjuncts. [2018-10-27 04:51:09,883 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:106, output treesize:120 [2018-10-27 04:51:10,044 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,046 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,048 INFO L477 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 71 treesize of output 68 [2018-10-27 04:51:10,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:10,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:150, output treesize:62 [2018-10-27 04:51:10,662 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-10-27 04:51:10,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:10,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:79 [2018-10-27 04:51:11,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 81 [2018-10-27 04:51:11,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:51:11,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:11,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:11,371 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-10-27 04:51:11,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:100 [2018-10-27 04:51:11,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-10-27 04:51:11,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,616 INFO L477 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 50 treesize of output 63 [2018-10-27 04:51:11,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:11,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:11,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:11,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:107 [2018-10-27 04:51:11,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-10-27 04:51:11,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,992 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:51:11,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:12,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:12,030 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-10-27 04:51:12,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:12,074 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-10-27 04:51:12,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:12,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:12,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:12,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:32 [2018-10-27 04:51:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:51:12,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:43,195 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 04:51:43,408 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 04:51:43,523 INFO L477 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 145 treesize of output 97 [2018-10-27 04:51:44,234 WARN L179 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2018-10-27 04:51:44,256 INFO L477 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 11 treesize of output 10 [2018-10-27 04:51:44,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:44,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:44,317 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:51:44,319 INFO L477 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 86 treesize of output 98 [2018-10-27 04:51:44,499 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-10-27 04:51:44,549 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:51:44,550 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:51:46,442 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 115 [2018-10-27 04:52:01,965 WARN L179 SmtUtils]: Spent 15.51 s on a formula simplification. DAG size of input: 230 DAG size of output: 184 [2018-10-27 04:52:01,975 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:01,975 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:02,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:02,016 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:02,018 INFO L477 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 96 treesize of output 110 [2018-10-27 04:52:02,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:02,025 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:02,026 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:02,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:02,028 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:02,030 INFO L477 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 66 treesize of output 87 [2018-10-27 04:52:02,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:24,466 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:24,468 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:26,473 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_prenex_43 (bvadd v_append_~node~0.offset_45 (_ bv1 32))) (select v_prenex_43 v_prenex_44)) [2018-10-27 04:52:26,478 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:26,479 INFO L303 Elim1Store]: Index analysis took 2039 ms [2018-10-27 04:52:26,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 95 [2018-10-27 04:52:26,480 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:36,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:36,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 73 treesize of output 86 [2018-10-27 04:52:36,905 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:03,363 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:03,363 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:03,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2018-10-27 04:53:03,365 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:11,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:21,806 INFO L477 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 77 treesize of output 69 [2018-10-27 04:53:21,825 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:21,827 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:21,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:21,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 82 [2018-10-27 04:53:21,941 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:21,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2018-10-27 04:53:21,948 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:21,960 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:21,969 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:21,990 INFO L477 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 81 treesize of output 71 [2018-10-27 04:53:21,998 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:21,999 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:22,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2018-10-27 04:53:23,489 WARN L179 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-10-27 04:53:23,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:23,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2018-10-27 04:53:23,501 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:23,508 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:23,516 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:23,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:23,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:23,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:23,618 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:172, output treesize:29 [2018-10-27 04:53:25,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:53:25,756 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c0e1296-5ad5-4f3f-9ab5-242d1149d51e/bin-2019/uautomizer/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-10-27 04:53:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:25,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:25,820 INFO L477 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-10-27 04:53:25,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:25,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:25,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:53:25,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:25,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:25,829 INFO L477 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 19 treesize of output 23 [2018-10-27 04:53:25,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:25,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:25,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-10-27 04:53:26,526 INFO L477 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 13 treesize of output 10 [2018-10-27 04:53:26,530 INFO L477 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 10 treesize of output 9 [2018-10-27 04:53:26,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:26,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:26,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:26,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-10-27 04:53:26,708 INFO L477 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 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:53:28,057 INFO L477 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 21 treesize of output 30 [2018-10-27 04:53:28,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:53:28,142 INFO L477 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-10-27 04:53:28,142 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:28,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:28,253 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:94 [2018-10-27 04:53:28,603 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-10-27 04:53:28,681 INFO L477 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 78 treesize of output 75 [2018-10-27 04:53:28,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,788 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-10-27 04:53:30,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 64 treesize of output 63 [2018-10-27 04:53:30,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:53:30,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:30,849 INFO L477 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 61 treesize of output 76 [2018-10-27 04:53:30,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:30,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:31,045 INFO L477 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 43 treesize of output 38 [2018-10-27 04:53:31,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:31,051 INFO L477 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-10-27 04:53:31,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:31,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:31,175 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 3 xjuncts. [2018-10-27 04:53:31,176 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:122, output treesize:145 [2018-10-27 04:53:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:31,466 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:31,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:31,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-10-27 04:53:31,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:31,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:31,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:208, output treesize:62 [2018-10-27 04:53:31,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:31,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:31,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:31,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-10-27 04:53:31,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:31,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:31,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:79 [2018-10-27 04:53:31,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-10-27 04:53:31,982 INFO L477 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 10 treesize of output 9 [2018-10-27 04:53:31,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,052 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-10-27 04:53:32,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:85 [2018-10-27 04:53:32,240 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-10-27 04:53:32,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-10-27 04:53:32,245 INFO L477 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 10 treesize of output 9 [2018-10-27 04:53:32,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:32,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:94 [2018-10-27 04:53:32,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2018-10-27 04:53:32,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:32,623 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 04:53:32,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,648 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-10-27 04:53:32,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,667 INFO L477 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-10-27 04:53:32,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:32,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:32,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:34 [2018-10-27 04:53:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:53:32,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:53:37,027 WARN L179 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 04:53:44,054 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 04:53:44,299 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-27 04:53:44,424 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 04:53:44,732 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-10-27 04:53:44,747 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:44,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:44,753 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:44,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:44,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 196 [2018-10-27 04:53:44,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:44,833 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 120 [2018-10-27 04:53:45,108 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-27 04:53:45,113 INFO L477 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 11 treesize of output 10 [2018-10-27 04:53:45,113 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:45,152 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:45,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 93 [2018-10-27 04:53:45,263 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2018-10-27 04:53:45,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:47,293 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2018-10-27 04:53:47,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:47,340 INFO L477 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 31 treesize of output 39 [2018-10-27 04:53:47,340 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:49,407 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:49,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:49,433 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:49,434 INFO L477 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 28 treesize of output 52 [2018-10-27 04:53:49,435 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:51,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:53,802 INFO L477 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 47 treesize of output 39 [2018-10-27 04:53:53,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:53,811 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:53,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:53,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:53:53,814 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:53,845 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:53,861 INFO L477 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 47 treesize of output 39 [2018-10-27 04:53:53,872 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:53,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:53,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-10-27 04:53:53,876 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:53,933 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:53,963 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:53,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:54,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:54,049 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:138, output treesize:20 [2018-10-27 04:54:07,721 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 04:54:17,055 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-10-27 04:54:17,097 INFO L477 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 120 treesize of output 91 [2018-10-27 04:54:17,422 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-27 04:54:17,430 INFO L477 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 11 treesize of output 10 [2018-10-27 04:54:17,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:17,749 INFO L477 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 4 case distinctions, treesize of input 58 treesize of output 76 [2018-10-27 04:54:18,057 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 04:54:18,066 INFO L477 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 63 treesize of output 66 [2018-10-27 04:54:18,074 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:18,075 INFO L477 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 20 treesize of output 28 [2018-10-27 04:54:18,076 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:18,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:18,155 INFO L477 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 73 treesize of output 76 [2018-10-27 04:54:18,162 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:18,164 INFO L477 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 20 treesize of output 28 [2018-10-27 04:54:18,164 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:18,228 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:18,234 INFO L477 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 50 treesize of output 53 [2018-10-27 04:54:18,268 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:18,270 INFO L477 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 20 treesize of output 28 [2018-10-27 04:54:18,270 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:18,319 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:18,816 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:19,369 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 75 [2018-10-27 04:54:19,377 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:19,378 INFO L477 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 66 treesize of output 74 [2018-10-27 04:54:19,379 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:20,256 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:20,263 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:20,263 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:20,265 INFO L303 Elim1Store]: Index analysis took 717 ms [2018-10-27 04:54:26,327 INFO L477 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 2 case distinctions, treesize of input 63 treesize of output 116 [2018-10-27 04:54:26,328 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-10-27 04:54:32,590 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:54:35,891 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 63 [2018-10-27 04:54:35,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:41,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 73 [2018-10-27 04:54:41,282 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-10-27 04:54:41,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:41,494 INFO L477 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 54 treesize of output 62 [2018-10-27 04:54:41,494 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:41,662 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:54:48,328 INFO L477 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 55 treesize of output 57 [2018-10-27 04:54:48,335 INFO L477 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 52 treesize of output 48 [2018-10-27 04:54:48,336 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:48,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:48,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 58 [2018-10-27 04:54:48,486 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:48,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:48,652 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-27 04:54:48,652 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:48,764 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:54:48,777 INFO L477 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 74 treesize of output 66 [2018-10-27 04:54:48,788 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:48,791 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:48,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-10-27 04:54:48,793 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:48,841 INFO L477 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 22 treesize of output 26 [2018-10-27 04:54:48,893 INFO L477 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 21 treesize of output 21 [2018-10-27 04:54:48,894 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:48,898 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:54:48,898 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:48,932 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:48,992 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:49,024 INFO L477 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 57 treesize of output 57 [2018-10-27 04:54:49,031 INFO L477 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 52 treesize of output 48 [2018-10-27 04:54:49,032 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:49,351 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:51,354 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_61 (_ bv5 32)) (bvadd append_~head.offset (_ bv4 32))) [2018-10-27 04:54:51,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:51,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:51,358 INFO L303 Elim1Store]: Index analysis took 2225 ms [2018-10-27 04:54:51,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-10-27 04:54:51,359 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:51,518 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:51,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 88 [2018-10-27 04:54:51,611 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:54:51,866 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-10-27 04:54:51,878 INFO L477 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 66 treesize of output 58 [2018-10-27 04:54:53,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:55,679 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_61 (_ bv5 32)) (bvadd append_~head.offset (_ bv4 32))) [2018-10-27 04:54:55,682 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:55,683 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:55,684 INFO L303 Elim1Store]: Index analysis took 3804 ms [2018-10-27 04:54:55,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:54:55,684 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:55,743 INFO L477 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 22 treesize of output 26 [2018-10-27 04:54:55,795 INFO L477 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 21 treesize of output 21 [2018-10-27 04:54:55,795 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:55,805 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:54:55,805 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:55,844 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:55,916 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:55,928 INFO L477 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 64 treesize of output 58 [2018-10-27 04:54:55,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:55,937 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-10-27 04:54:55,937 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:55,977 INFO L477 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 22 treesize of output 26 [2018-10-27 04:54:56,029 INFO L477 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 23 treesize of output 23 [2018-10-27 04:54:56,030 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:56,033 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:54:56,033 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:56,068 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:56,129 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:56,158 INFO L477 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 55 treesize of output 57 [2018-10-27 04:54:56,164 INFO L477 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 52 treesize of output 48 [2018-10-27 04:54:56,164 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:56,247 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:56,249 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-27 04:54:56,249 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:56,340 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:56,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 58 [2018-10-27 04:54:56,374 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:56,461 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:54:57,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 62 [2018-10-27 04:54:57,854 INFO L477 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 41 [2018-10-27 04:54:57,854 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:58,071 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:58,072 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-10-27 04:54:58,072 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:58,287 INFO L477 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 33 treesize of output 33 [2018-10-27 04:54:58,288 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:58,516 INFO L477 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 52 treesize of output 44 [2018-10-27 04:54:58,516 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:58,751 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:58,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 52 [2018-10-27 04:54:58,781 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:58,990 INFO L477 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 44 treesize of output 40 [2018-10-27 04:54:58,990 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:59,202 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:59,203 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-10-27 04:54:59,203 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:59,489 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:59,506 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-10-27 04:54:59,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 85 [2018-10-27 04:54:59,578 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:54:59,867 INFO L267 ElimStorePlain]: Start of recursive call 44: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-10-27 04:55:00,003 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-10-27 04:55:00,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2018-10-27 04:55:00,104 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:00,106 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-10-27 04:55:00,106 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:00,219 INFO L477 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 46 treesize of output 38 [2018-10-27 04:55:00,220 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:00,323 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:00,324 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-10-27 04:55:00,325 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:00,396 INFO L477 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 38 treesize of output 41 [2018-10-27 04:55:00,459 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:55:00,459 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:00,479 INFO L477 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 23 treesize of output 23 [2018-10-27 04:55:00,479 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:00,542 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:01,256 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 53 [2018-10-27 04:55:01,383 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-27 04:55:01,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2018-10-27 04:55:01,448 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:55:01,450 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:55:01,450 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:01,452 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:55:01,452 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:01,749 INFO L477 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 42 treesize of output 42 [2018-10-27 04:55:01,750 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:02,037 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-10-27 04:55:02,349 INFO L267 ElimStorePlain]: Start of recursive call 53: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-10-27 04:55:04,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 70 [2018-10-27 04:55:04,755 INFO L477 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 57 treesize of output 60 [2018-10-27 04:55:04,860 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 04:55:04,862 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:55:04,863 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:04,888 INFO L477 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 21 treesize of output 21 [2018-10-27 04:55:04,889 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:05,005 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:05,368 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:05,369 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:05,571 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:55:05,571 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_81 term size 42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-10-27 04:55:05,575 INFO L168 Benchmark]: Toolchain (without parser) took 316672.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -224.6 MB). Peak memory consumption was 449.6 MB. Max. memory is 11.5 GB. [2018-10-27 04:55:05,575 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:55:05,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.65 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 922.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 04:55:05,576 INFO L168 Benchmark]: Boogie Preprocessor took 67.85 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:55:05,576 INFO L168 Benchmark]: RCFGBuilder took 1481.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:55:05,576 INFO L168 Benchmark]: TraceAbstraction took 314558.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.7 MB). Peak memory consumption was 432.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:55:05,578 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.65 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 922.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.85 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1481.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 314558.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.7 MB). Peak memory consumption was 432.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_81 term size 42 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_81 term size 42: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...