./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/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 60916622e39af1ac5f6b241a411b0d3cb1574dbf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:23:20,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:23:20,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:23:20,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:23:20,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:23:20,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:23:20,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:23:20,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:23:20,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:23:20,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:23:20,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:23:20,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:23:20,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:23:20,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:23:20,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:23:20,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:23:20,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:23:20,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:23:20,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:23:20,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:23:20,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:23:20,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:23:20,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:23:20,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:23:20,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:23:20,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:23:20,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:23:20,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:23:20,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:23:20,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:23:20,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:23:20,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:23:20,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:23:20,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:23:20,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:23:20,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:23:20,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:23:20,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:23:20,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:23:20,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:23:20,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:23:20,072 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 15:23:20,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:23:20,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:23:20,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:23:20,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:23:20,082 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:23:20,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:23:20,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:23:20,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:23:20,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:23:20,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:23:20,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:23:20,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:23:20,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:23:20,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:23:20,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/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 -> 60916622e39af1ac5f6b241a411b0d3cb1574dbf [2019-12-07 15:23:20,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:23:20,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:23:20,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:23:20,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:23:20,196 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:23:20,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2019-12-07 15:23:20,233 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/data/3cc1dbfb4/4517f014bd964ccb8a298db427d34d47/FLAG10b6bb743 [2019-12-07 15:23:20,781 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:23:20,782 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2019-12-07 15:23:20,791 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/data/3cc1dbfb4/4517f014bd964ccb8a298db427d34d47/FLAG10b6bb743 [2019-12-07 15:23:21,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/data/3cc1dbfb4/4517f014bd964ccb8a298db427d34d47 [2019-12-07 15:23:21,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:23:21,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 15:23:21,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:23:21,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:23:21,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:23:21,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28400874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21, skipping insertion in model container [2019-12-07 15:23:21,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:23:21,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:23:21,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:23:21,487 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:23:21,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:23:21,551 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:23:21,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21 WrapperNode [2019-12-07 15:23:21,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:23:21,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:23:21,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:23:21,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:23:21,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... [2019-12-07 15:23:21,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:23:21,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:23:21,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:23:21,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:23:21,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/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 [2019-12-07 15:23:21,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 15:23:21,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:23:21,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 15:23:21,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 15:23:21,632 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 15:23:21,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 15:23:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 15:23:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 15:23:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 15:23:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 15:23:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 15:23:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 15:23:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 15:23:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 15:23:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 15:23:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:23:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:23:21,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 15:23:21,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:23:21,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 15:23:21,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:23:21,800 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 15:23:21,977 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:23:21,977 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 15:23:21,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:23:21 BoogieIcfgContainer [2019-12-07 15:23:21,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:23:21,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:23:21,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:23:21,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:23:21,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:23:21" (1/3) ... [2019-12-07 15:23:21,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ea0e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:23:21, skipping insertion in model container [2019-12-07 15:23:21,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:23:21" (2/3) ... [2019-12-07 15:23:21,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ea0e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:23:21, skipping insertion in model container [2019-12-07 15:23:21,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:23:21" (3/3) ... [2019-12-07 15:23:21,985 INFO L109 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2019-12-07 15:23:21,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:23:21,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2019-12-07 15:23:22,004 INFO L249 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2019-12-07 15:23:22,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:23:22,017 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 15:23:22,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:23:22,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:23:22,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:23:22,017 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:23:22,017 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:23:22,017 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:23:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-12-07 15:23:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:23:22,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:22,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:22,039 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2007947877, now seen corresponding path program 1 times [2019-12-07 15:23:22,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:22,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805716605] [2019-12-07 15:23:22,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:22,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805716605] [2019-12-07 15:23:22,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:22,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:23:22,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793476286] [2019-12-07 15:23:22,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:23:22,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:23:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:23:22,184 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2019-12-07 15:23:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:22,362 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2019-12-07 15:23:22,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:23:22,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 15:23:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:22,370 INFO L225 Difference]: With dead ends: 128 [2019-12-07 15:23:22,370 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 15:23:22,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:23:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 15:23:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2019-12-07 15:23:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 15:23:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-12-07 15:23:22,400 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 8 [2019-12-07 15:23:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:22,400 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-12-07 15:23:22,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:23:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-12-07 15:23:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:23:22,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:22,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:22,401 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:22,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2007947878, now seen corresponding path program 1 times [2019-12-07 15:23:22,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:22,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234249878] [2019-12-07 15:23:22,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:22,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234249878] [2019-12-07 15:23:22,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:22,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:23:22,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803303034] [2019-12-07 15:23:22,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:23:22,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:23:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:23:22,445 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 4 states. [2019-12-07 15:23:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:22,575 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-12-07 15:23:22,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:23:22,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 15:23:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:22,577 INFO L225 Difference]: With dead ends: 99 [2019-12-07 15:23:22,577 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 15:23:22,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:23:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 15:23:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 15:23:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 15:23:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-12-07 15:23:22,584 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 8 [2019-12-07 15:23:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-12-07 15:23:22,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:23:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-12-07 15:23:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:23:22,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:22,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:22,586 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash -783047428, now seen corresponding path program 1 times [2019-12-07 15:23:22,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:22,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870235821] [2019-12-07 15:23:22,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:22,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870235821] [2019-12-07 15:23:22,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:22,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:23:22,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410003949] [2019-12-07 15:23:22,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:23:22,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:22,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:23:22,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:23:22,630 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 5 states. [2019-12-07 15:23:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:22,783 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-12-07 15:23:22,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:23:22,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 15:23:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:22,784 INFO L225 Difference]: With dead ends: 109 [2019-12-07 15:23:22,784 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 15:23:22,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:23:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 15:23:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-12-07 15:23:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 15:23:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-12-07 15:23:22,791 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 13 [2019-12-07 15:23:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:22,791 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-12-07 15:23:22,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:23:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-12-07 15:23:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:23:22,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:22,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:22,792 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -783047427, now seen corresponding path program 1 times [2019-12-07 15:23:22,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:22,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504887314] [2019-12-07 15:23:22,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:22,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504887314] [2019-12-07 15:23:22,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:22,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:23:22,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048379549] [2019-12-07 15:23:22,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:23:22,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:22,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:23:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:23:22,843 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 5 states. [2019-12-07 15:23:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:23,011 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-12-07 15:23:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:23:23,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 15:23:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:23,018 INFO L225 Difference]: With dead ends: 127 [2019-12-07 15:23:23,018 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 15:23:23,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:23:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 15:23:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2019-12-07 15:23:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 15:23:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2019-12-07 15:23:23,027 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 13 [2019-12-07 15:23:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:23,028 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2019-12-07 15:23:23,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:23:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2019-12-07 15:23:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:23:23,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:23,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:23,029 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 718721595, now seen corresponding path program 1 times [2019-12-07 15:23:23,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:23,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906745595] [2019-12-07 15:23:23,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:23,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906745595] [2019-12-07 15:23:23,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:23,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:23:23,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492165459] [2019-12-07 15:23:23,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:23:23,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:23,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:23:23,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:23:23,090 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 7 states. [2019-12-07 15:23:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:23,207 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2019-12-07 15:23:23,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:23:23,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 15:23:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:23,210 INFO L225 Difference]: With dead ends: 160 [2019-12-07 15:23:23,210 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 15:23:23,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:23:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 15:23:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2019-12-07 15:23:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 15:23:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2019-12-07 15:23:23,219 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 19 [2019-12-07 15:23:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:23,220 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2019-12-07 15:23:23,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:23:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2019-12-07 15:23:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:23:23,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:23,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:23,221 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash -771302006, now seen corresponding path program 1 times [2019-12-07 15:23:23,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:23,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980601524] [2019-12-07 15:23:23,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:23,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980601524] [2019-12-07 15:23:23,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:23,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:23:23,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996279196] [2019-12-07 15:23:23,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:23:23,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:23:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:23:23,276 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 7 states. [2019-12-07 15:23:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:23,470 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2019-12-07 15:23:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:23:23,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 15:23:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:23,472 INFO L225 Difference]: With dead ends: 173 [2019-12-07 15:23:23,472 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 15:23:23,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:23:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 15:23:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2019-12-07 15:23:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 15:23:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2019-12-07 15:23:23,477 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 21 [2019-12-07 15:23:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:23,477 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2019-12-07 15:23:23,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:23:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2019-12-07 15:23:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:23:23,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:23,478 INFO L410 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] [2019-12-07 15:23:23,478 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:23,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:23,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1667398511, now seen corresponding path program 1 times [2019-12-07 15:23:23,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:23,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72376782] [2019-12-07 15:23:23,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:23,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72376782] [2019-12-07 15:23:23,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:23,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:23:23,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923759852] [2019-12-07 15:23:23,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:23:23,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:23:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:23:23,520 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 5 states. [2019-12-07 15:23:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:23,644 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2019-12-07 15:23:23,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:23:23,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 15:23:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:23,645 INFO L225 Difference]: With dead ends: 126 [2019-12-07 15:23:23,645 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 15:23:23,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:23:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 15:23:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2019-12-07 15:23:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 15:23:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2019-12-07 15:23:23,650 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 23 [2019-12-07 15:23:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:23,650 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2019-12-07 15:23:23,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:23:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2019-12-07 15:23:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:23:23,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:23,651 INFO L410 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] [2019-12-07 15:23:23,651 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2122527449, now seen corresponding path program 1 times [2019-12-07 15:23:23,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:23,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489055012] [2019-12-07 15:23:23,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:23,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489055012] [2019-12-07 15:23:23,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:23,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:23:23,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206059197] [2019-12-07 15:23:23,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:23:23,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:23:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:23:23,714 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 6 states. [2019-12-07 15:23:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:23,844 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2019-12-07 15:23:23,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:23:23,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 15:23:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:23,845 INFO L225 Difference]: With dead ends: 155 [2019-12-07 15:23:23,845 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 15:23:23,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:23:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 15:23:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2019-12-07 15:23:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 15:23:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2019-12-07 15:23:23,849 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 26 [2019-12-07 15:23:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:23,850 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2019-12-07 15:23:23,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:23:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2019-12-07 15:23:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:23:23,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:23,850 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:23,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:23,851 INFO L82 PathProgramCache]: Analyzing trace with hash -712625485, now seen corresponding path program 1 times [2019-12-07 15:23:23,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:23,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792482181] [2019-12-07 15:23:23,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:23,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792482181] [2019-12-07 15:23:23,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:23,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:23:23,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535551362] [2019-12-07 15:23:23,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:23:23,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:23,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:23:23,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:23:23,893 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 7 states. [2019-12-07 15:23:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:24,115 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-12-07 15:23:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:23:24,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 15:23:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:24,116 INFO L225 Difference]: With dead ends: 124 [2019-12-07 15:23:24,116 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 15:23:24,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:23:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 15:23:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-12-07 15:23:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 15:23:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2019-12-07 15:23:24,120 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 26 [2019-12-07 15:23:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:24,120 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2019-12-07 15:23:24,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:23:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2019-12-07 15:23:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:23:24,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:24,121 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:24,121 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -712625484, now seen corresponding path program 1 times [2019-12-07 15:23:24,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:24,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054409320] [2019-12-07 15:23:24,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:24,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054409320] [2019-12-07 15:23:24,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:24,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:23:24,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877846901] [2019-12-07 15:23:24,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:23:24,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:23:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:23:24,180 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand 7 states. [2019-12-07 15:23:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:24,480 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2019-12-07 15:23:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:23:24,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 15:23:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:24,481 INFO L225 Difference]: With dead ends: 121 [2019-12-07 15:23:24,481 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 15:23:24,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:23:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 15:23:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-12-07 15:23:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 15:23:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2019-12-07 15:23:24,485 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 26 [2019-12-07 15:23:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:24,485 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2019-12-07 15:23:24,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:23:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2019-12-07 15:23:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 15:23:24,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:24,486 INFO L410 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] [2019-12-07 15:23:24,487 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash 438105490, now seen corresponding path program 1 times [2019-12-07 15:23:24,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:24,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982466046] [2019-12-07 15:23:24,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:23:24,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982466046] [2019-12-07 15:23:24,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:24,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:23:24,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689197886] [2019-12-07 15:23:24,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:23:24,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:23:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:23:24,622 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 9 states. [2019-12-07 15:23:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:24,882 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2019-12-07 15:23:24,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:23:24,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-12-07 15:23:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:24,883 INFO L225 Difference]: With dead ends: 111 [2019-12-07 15:23:24,883 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 15:23:24,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:23:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 15:23:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2019-12-07 15:23:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 15:23:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-12-07 15:23:24,885 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 29 [2019-12-07 15:23:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:24,886 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-12-07 15:23:24,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:23:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-12-07 15:23:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 15:23:24,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:24,886 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:24,887 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1623194290, now seen corresponding path program 1 times [2019-12-07 15:23:24,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:24,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047830509] [2019-12-07 15:23:24,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:23:24,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047830509] [2019-12-07 15:23:24,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:24,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:23:24,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082226559] [2019-12-07 15:23:24,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:23:24,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:23:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:23:24,936 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 8 states. [2019-12-07 15:23:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:25,034 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2019-12-07 15:23:25,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:23:25,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-07 15:23:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:25,035 INFO L225 Difference]: With dead ends: 144 [2019-12-07 15:23:25,035 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 15:23:25,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:23:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 15:23:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2019-12-07 15:23:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 15:23:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2019-12-07 15:23:25,039 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 32 [2019-12-07 15:23:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:25,039 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2019-12-07 15:23:25,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:23:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2019-12-07 15:23:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 15:23:25,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:25,040 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:25,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1991714636, now seen corresponding path program 1 times [2019-12-07 15:23:25,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:25,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969770374] [2019-12-07 15:23:25,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:25,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969770374] [2019-12-07 15:23:25,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016423855] [2019-12-07 15:23:25,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:25,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:23:25,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:25,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:25,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:25,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-12-07 15:23:25,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867149763] [2019-12-07 15:23:25,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:23:25,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:23:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:23:25,209 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand 12 states. [2019-12-07 15:23:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:25,458 INFO L93 Difference]: Finished difference Result 260 states and 294 transitions. [2019-12-07 15:23:25,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 15:23:25,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-12-07 15:23:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:25,460 INFO L225 Difference]: With dead ends: 260 [2019-12-07 15:23:25,460 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 15:23:25,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-07 15:23:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 15:23:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 158. [2019-12-07 15:23:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 15:23:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 197 transitions. [2019-12-07 15:23:25,464 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 197 transitions. Word has length 32 [2019-12-07 15:23:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:25,464 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 197 transitions. [2019-12-07 15:23:25,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:23:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2019-12-07 15:23:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:23:25,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:25,465 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:25,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:25,667 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash 843564097, now seen corresponding path program 1 times [2019-12-07 15:23:25,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:25,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271325171] [2019-12-07 15:23:25,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:25,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271325171] [2019-12-07 15:23:25,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585838975] [2019-12-07 15:23:25,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:25,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 15:23:25,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:25,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:23:25,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:25,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:25,975 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:25,975 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:26,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:26,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:26,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:26,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,011 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 15:23:26,033 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_20|], 2=[|v_#memory_int_22|]} [2019-12-07 15:23:26,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:26,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:26,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:26,053 INFO L377 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 27 treesize of output 11 [2019-12-07 15:23:26,053 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:26,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,063 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-12-07 15:23:26,088 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:26,088 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:26,096 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,096 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-12-07 15:23:26,137 INFO L377 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 19 treesize of output 18 [2019-12-07 15:23:26,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:26,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:26,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:26,205 INFO L377 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 22 treesize of output 10 [2019-12-07 15:23:26,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:26,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:26,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-12-07 15:23:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:26,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:26,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-12-07 15:23:26,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599594012] [2019-12-07 15:23:26,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:23:26,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:23:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:23:26,217 INFO L87 Difference]: Start difference. First operand 158 states and 197 transitions. Second operand 24 states. [2019-12-07 15:23:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:26,880 INFO L93 Difference]: Finished difference Result 307 states and 370 transitions. [2019-12-07 15:23:26,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 15:23:26,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2019-12-07 15:23:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:26,882 INFO L225 Difference]: With dead ends: 307 [2019-12-07 15:23:26,882 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 15:23:26,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 15:23:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 15:23:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 174. [2019-12-07 15:23:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 15:23:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2019-12-07 15:23:26,886 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 34 [2019-12-07 15:23:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:26,887 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2019-12-07 15:23:26,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:23:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2019-12-07 15:23:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:23:26,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:26,887 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:27,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:27,089 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash 843256267, now seen corresponding path program 1 times [2019-12-07 15:23:27,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:27,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762047484] [2019-12-07 15:23:27,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:27,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762047484] [2019-12-07 15:23:27,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129459154] [2019-12-07 15:23:27,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:27,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 15:23:27,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:27,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:27,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2019-12-07 15:23:27,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:27,425 INFO L377 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 20 [2019-12-07 15:23:27,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,435 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,435 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-12-07 15:23:27,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:27,465 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2019-12-07 15:23:27,498 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_21|], 6=[|v_#memory_int_26|]} [2019-12-07 15:23:27,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:27,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:27,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:27,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:27,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 15:23:27,519 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,529 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,529 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:39 [2019-12-07 15:23:27,557 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:27,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,565 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,565 INFO L534 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. [2019-12-07 15:23:27,565 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2019-12-07 15:23:27,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:27,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-12-07 15:23:27,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,625 INFO L534 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. [2019-12-07 15:23:27,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2019-12-07 15:23:27,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:27,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:23:27,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 15:23:27,708 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:27,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:27,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:3 [2019-12-07 15:23:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:27,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:27,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-12-07 15:23:27,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841172197] [2019-12-07 15:23:27,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 15:23:27,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 15:23:27,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-12-07 15:23:27,734 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand 29 states. [2019-12-07 15:23:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:29,104 INFO L93 Difference]: Finished difference Result 278 states and 338 transitions. [2019-12-07 15:23:29,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 15:23:29,104 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2019-12-07 15:23:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:29,106 INFO L225 Difference]: With dead ends: 278 [2019-12-07 15:23:29,106 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 15:23:29,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1312, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 15:23:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 15:23:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 174. [2019-12-07 15:23:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 15:23:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2019-12-07 15:23:29,111 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 34 [2019-12-07 15:23:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:29,111 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2019-12-07 15:23:29,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 15:23:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2019-12-07 15:23:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:23:29,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:29,112 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:29,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:29,314 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1461350625, now seen corresponding path program 1 times [2019-12-07 15:23:29,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:29,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456702891] [2019-12-07 15:23:29,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:29,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456702891] [2019-12-07 15:23:29,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370623006] [2019-12-07 15:23:29,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:29,561 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 15:23:29,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:29,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:29,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,610 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,610 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:20 [2019-12-07 15:23:29,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:29,664 INFO L377 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 22 treesize of output 21 [2019-12-07 15:23:29,665 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,680 INFO L614 ElimStorePlain]: treesize reduction 5, result has 87.5 percent of original size [2019-12-07 15:23:29,680 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-12-07 15:23:29,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:29,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,718 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2019-12-07 15:23:29,748 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_22|], 6=[|v_#memory_int_30|]} [2019-12-07 15:23:29,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:29,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:29,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:29,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:29,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-07 15:23:29,769 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,779 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,779 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:40 [2019-12-07 15:23:29,806 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:29,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,812 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,812 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2019-12-07 15:23:29,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:29,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-12-07 15:23:29,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,861 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:29,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-12-07 15:23:29,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:29,929 INFO L377 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 0 case distinctions, treesize of input 34 treesize of output 14 [2019-12-07 15:23:29,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:29,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:29,935 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:4 [2019-12-07 15:23:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:29,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:29,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-12-07 15:23:29,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464337936] [2019-12-07 15:23:29,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 15:23:29,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:29,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 15:23:29,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-12-07 15:23:29,942 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand 28 states. [2019-12-07 15:23:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:31,942 INFO L93 Difference]: Finished difference Result 355 states and 422 transitions. [2019-12-07 15:23:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 15:23:31,943 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-12-07 15:23:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:31,947 INFO L225 Difference]: With dead ends: 355 [2019-12-07 15:23:31,947 INFO L226 Difference]: Without dead ends: 355 [2019-12-07 15:23:31,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 15:23:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-07 15:23:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 192. [2019-12-07 15:23:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 15:23:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2019-12-07 15:23:31,959 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 34 [2019-12-07 15:23:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:31,959 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2019-12-07 15:23:31,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 15:23:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2019-12-07 15:23:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:23:31,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:31,961 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:32,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:32,162 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:32,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:32,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1461042795, now seen corresponding path program 1 times [2019-12-07 15:23:32,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:32,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432339982] [2019-12-07 15:23:32,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:32,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432339982] [2019-12-07 15:23:32,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111512936] [2019-12-07 15:23:32,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:32,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 15:23:32,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:32,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:23:32,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:32,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:32,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 15:23:32,461 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_33|]} [2019-12-07 15:23:32,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:32,464 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:32,481 INFO L377 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 27 treesize of output 11 [2019-12-07 15:23:32,481 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,489 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-12-07 15:23:32,513 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:32,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-12-07 15:23:32,556 INFO L377 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 19 treesize of output 18 [2019-12-07 15:23:32,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:32,562 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:32,626 INFO L377 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 22 treesize of output 10 [2019-12-07 15:23:32,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:32,631 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:32,631 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-12-07 15:23:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:32,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:32,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-12-07 15:23:32,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491880468] [2019-12-07 15:23:32,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:23:32,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:23:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:23:32,636 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand 24 states. [2019-12-07 15:23:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:33,451 INFO L93 Difference]: Finished difference Result 306 states and 366 transitions. [2019-12-07 15:23:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 15:23:33,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2019-12-07 15:23:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:33,452 INFO L225 Difference]: With dead ends: 306 [2019-12-07 15:23:33,452 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 15:23:33,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 15:23:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 15:23:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 192. [2019-12-07 15:23:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 15:23:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 233 transitions. [2019-12-07 15:23:33,457 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 233 transitions. Word has length 34 [2019-12-07 15:23:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:33,457 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 233 transitions. [2019-12-07 15:23:33,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:23:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 233 transitions. [2019-12-07 15:23:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 15:23:33,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:33,458 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:33,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:33,659 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1083723752, now seen corresponding path program 1 times [2019-12-07 15:23:33,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:33,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333941371] [2019-12-07 15:23:33,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:33,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333941371] [2019-12-07 15:23:33,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982526713] [2019-12-07 15:23:33,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:33,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 15:23:33,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:33,976 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:33,977 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:23:33,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:33,994 INFO L614 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-12-07 15:23:33,995 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:33,995 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-12-07 15:23:34,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:34,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:34,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:34,028 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:34,028 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2019-12-07 15:23:34,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:34,091 INFO L377 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 1 case distinctions, treesize of input 45 treesize of output 59 [2019-12-07 15:23:34,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:34,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:34,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:34,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:23:34,107 INFO L614 ElimStorePlain]: treesize reduction 57, result has 31.3 percent of original size [2019-12-07 15:23:34,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:34,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:26 [2019-12-07 15:23:34,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:23:34,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-12-07 15:23:34,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:34,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:34,165 INFO L534 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. [2019-12-07 15:23:34,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2019-12-07 15:23:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:34,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:34,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-12-07 15:23:34,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681113362] [2019-12-07 15:23:34,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 15:23:34,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 15:23:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-07 15:23:34,199 INFO L87 Difference]: Start difference. First operand 192 states and 233 transitions. Second operand 26 states. [2019-12-07 15:23:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:34,983 INFO L93 Difference]: Finished difference Result 309 states and 362 transitions. [2019-12-07 15:23:34,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 15:23:34,983 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-12-07 15:23:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:34,985 INFO L225 Difference]: With dead ends: 309 [2019-12-07 15:23:34,985 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 15:23:34,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1028, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 15:23:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 15:23:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 192. [2019-12-07 15:23:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 15:23:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 232 transitions. [2019-12-07 15:23:34,989 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 232 transitions. Word has length 36 [2019-12-07 15:23:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:34,989 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 232 transitions. [2019-12-07 15:23:34,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 15:23:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 232 transitions. [2019-12-07 15:23:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 15:23:34,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:34,990 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:35,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:35,190 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1083723751, now seen corresponding path program 1 times [2019-12-07 15:23:35,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:35,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294126107] [2019-12-07 15:23:35,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:35,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294126107] [2019-12-07 15:23:35,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693010729] [2019-12-07 15:23:35,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:35,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 15:23:35,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:35,436 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_41|], 1=[|v_#valid_61|]} [2019-12-07 15:23:35,438 INFO L377 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 [2019-12-07 15:23:35,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:35,452 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,460 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-12-07 15:23:35,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:35,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:35,499 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,509 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2019-12-07 15:23:35,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,616 INFO L377 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 1 case distinctions, treesize of input 88 treesize of output 82 [2019-12-07 15:23:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:35,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:23:35,648 INFO L614 ElimStorePlain]: treesize reduction 137, result has 34.8 percent of original size [2019-12-07 15:23:35,651 INFO L377 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 43 treesize of output 13 [2019-12-07 15:23:35,651 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,659 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:35,659 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:40 [2019-12-07 15:23:35,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:23:35,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 15:23:35,738 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:23:35,750 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 15:23:35,750 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,757 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:35,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:35,758 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-12-07 15:23:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:35,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:35,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-12-07 15:23:35,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46981730] [2019-12-07 15:23:35,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:23:35,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:35,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:23:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:23:35,771 INFO L87 Difference]: Start difference. First operand 192 states and 232 transitions. Second operand 24 states. [2019-12-07 15:23:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:36,850 INFO L93 Difference]: Finished difference Result 285 states and 329 transitions. [2019-12-07 15:23:36,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 15:23:36,851 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2019-12-07 15:23:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:36,852 INFO L225 Difference]: With dead ends: 285 [2019-12-07 15:23:36,852 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 15:23:36,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 15:23:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 15:23:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 183. [2019-12-07 15:23:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-07 15:23:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 214 transitions. [2019-12-07 15:23:36,856 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 214 transitions. Word has length 36 [2019-12-07 15:23:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:36,857 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 214 transitions. [2019-12-07 15:23:36,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:23:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 214 transitions. [2019-12-07 15:23:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 15:23:36,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:36,857 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:37,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:37,059 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -64847664, now seen corresponding path program 1 times [2019-12-07 15:23:37,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:37,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415334771] [2019-12-07 15:23:37,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:37,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415334771] [2019-12-07 15:23:37,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741905970] [2019-12-07 15:23:37,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:37,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 15:23:37,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:37,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:23:37,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:37,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:37,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 15:23:37,365 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|], 2=[|v_#memory_int_36|]} [2019-12-07 15:23:37,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:37,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:37,385 INFO L377 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 27 treesize of output 11 [2019-12-07 15:23:37,386 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,395 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-12-07 15:23:37,418 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:37,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-12-07 15:23:37,458 INFO L377 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 19 treesize of output 18 [2019-12-07 15:23:37,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:37,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:37,511 INFO L377 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 22 treesize of output 10 [2019-12-07 15:23:37,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:37,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:37,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-12-07 15:23:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:37,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:37,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-12-07 15:23:37,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229245736] [2019-12-07 15:23:37,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:23:37,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:23:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:23:37,522 INFO L87 Difference]: Start difference. First operand 183 states and 214 transitions. Second operand 24 states. [2019-12-07 15:23:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:39,299 INFO L93 Difference]: Finished difference Result 308 states and 356 transitions. [2019-12-07 15:23:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 15:23:39,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2019-12-07 15:23:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:39,300 INFO L225 Difference]: With dead ends: 308 [2019-12-07 15:23:39,300 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 15:23:39,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 15:23:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 15:23:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 183. [2019-12-07 15:23:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-07 15:23:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2019-12-07 15:23:39,304 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 39 [2019-12-07 15:23:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:39,304 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2019-12-07 15:23:39,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:23:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2019-12-07 15:23:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 15:23:39,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:39,305 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:39,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:39,505 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1658669008, now seen corresponding path program 1 times [2019-12-07 15:23:39,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:39,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908985578] [2019-12-07 15:23:39,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:39,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908985578] [2019-12-07 15:23:39,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466869243] [2019-12-07 15:23:39,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:39,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 15:23:39,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:39,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:23:39,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:39,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:39,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,746 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,746 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 15:23:39,766 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_29|], 2=[|v_#memory_int_39|]} [2019-12-07 15:23:39,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:39,769 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:39,785 INFO L377 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 27 treesize of output 11 [2019-12-07 15:23:39,785 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,793 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,793 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-12-07 15:23:39,816 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:39,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-12-07 15:23:39,855 INFO L377 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 19 treesize of output 18 [2019-12-07 15:23:39,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,861 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:39,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:39,910 INFO L377 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 22 treesize of output 10 [2019-12-07 15:23:39,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:39,914 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:39,915 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-12-07 15:23:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:39,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:39,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-12-07 15:23:39,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038546369] [2019-12-07 15:23:39,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:23:39,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:23:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:23:39,920 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 24 states. [2019-12-07 15:23:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:40,753 INFO L93 Difference]: Finished difference Result 306 states and 352 transitions. [2019-12-07 15:23:40,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 15:23:40,753 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2019-12-07 15:23:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:40,754 INFO L225 Difference]: With dead ends: 306 [2019-12-07 15:23:40,754 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 15:23:40,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 15:23:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 15:23:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 183. [2019-12-07 15:23:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-07 15:23:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2019-12-07 15:23:40,758 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 39 [2019-12-07 15:23:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:40,758 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2019-12-07 15:23:40,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:23:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2019-12-07 15:23:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 15:23:40,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:40,758 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:40,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:40,960 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:40,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:40,961 INFO L82 PathProgramCache]: Analyzing trace with hash -57152383, now seen corresponding path program 1 times [2019-12-07 15:23:40,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:40,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033011921] [2019-12-07 15:23:40,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:41,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033011921] [2019-12-07 15:23:41,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44795391] [2019-12-07 15:23:41,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:41,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 15:23:41,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:41,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:41,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 15:23:41,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:41,266 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:41,276 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,282 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,283 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:20 [2019-12-07 15:23:41,296 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_31|]} [2019-12-07 15:23:41,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 19 [2019-12-07 15:23:41,299 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,310 INFO L377 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 110 treesize of output 82 [2019-12-07 15:23:41,310 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,317 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,330 INFO L377 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 1 case distinctions, treesize of input 75 treesize of output 105 [2019-12-07 15:23:41,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:41,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:41,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:41,331 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-12-07 15:23:41,348 INFO L614 ElimStorePlain]: treesize reduction 99, result has 25.0 percent of original size [2019-12-07 15:23:41,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,348 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:133, output treesize:33 [2019-12-07 15:23:41,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:23:41,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2019-12-07 15:23:41,400 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,408 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:23:41,408 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2019-12-07 15:23:41,408 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,413 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-12-07 15:23:41,416 INFO L377 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 15 treesize of output 7 [2019-12-07 15:23:41,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:41,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:41,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 15:23:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:41,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:41,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 21 [2019-12-07 15:23:41,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549912113] [2019-12-07 15:23:41,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 15:23:41,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 15:23:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:23:41,423 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 21 states. [2019-12-07 15:23:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:42,095 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2019-12-07 15:23:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 15:23:42,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-12-07 15:23:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:42,096 INFO L225 Difference]: With dead ends: 235 [2019-12-07 15:23:42,096 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 15:23:42,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 15:23:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 15:23:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 185. [2019-12-07 15:23:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-07 15:23:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2019-12-07 15:23:42,099 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 42 [2019-12-07 15:23:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:42,099 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2019-12-07 15:23:42,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 15:23:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2019-12-07 15:23:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 15:23:42,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:42,100 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 15:23:42,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:42,301 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash -756973424, now seen corresponding path program 1 times [2019-12-07 15:23:42,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:42,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544828022] [2019-12-07 15:23:42,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:42,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544828022] [2019-12-07 15:23:42,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195355628] [2019-12-07 15:23:42,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:42,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 15:23:42,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:42,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:42,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:42,598 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:42,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:42,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:42,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-12-07 15:23:42,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:42,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:42,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:42,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:42,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2019-12-07 15:23:42,697 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:42,697 INFO L377 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 1 case distinctions, treesize of input 54 treesize of output 66 [2019-12-07 15:23:42,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:42,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:42,708 INFO L614 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2019-12-07 15:23:42,708 INFO L534 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. [2019-12-07 15:23:42,708 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2019-12-07 15:23:42,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:42,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-12-07 15:23:42,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:42,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:23:42,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:42,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:42,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 15:23:42,771 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:13 [2019-12-07 15:23:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 15:23:42,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:42,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-12-07 15:23:42,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880472279] [2019-12-07 15:23:42,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 15:23:42,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 15:23:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2019-12-07 15:23:42,806 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand 27 states. [2019-12-07 15:23:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:43,587 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2019-12-07 15:23:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:23:43,587 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-12-07 15:23:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:43,588 INFO L225 Difference]: With dead ends: 235 [2019-12-07 15:23:43,589 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 15:23:43,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 15:23:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 15:23:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 190. [2019-12-07 15:23:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-07 15:23:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2019-12-07 15:23:43,592 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 47 [2019-12-07 15:23:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:43,592 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2019-12-07 15:23:43,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 15:23:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2019-12-07 15:23:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 15:23:43,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:43,592 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:43,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:43,793 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:43,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:43,794 INFO L82 PathProgramCache]: Analyzing trace with hash -222839062, now seen corresponding path program 2 times [2019-12-07 15:23:43,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:43,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278622473] [2019-12-07 15:23:43,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:43,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278622473] [2019-12-07 15:23:43,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434578426] [2019-12-07 15:23:43,987 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:44,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:23:44,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:23:44,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 15:23:44,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:44,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:23:44,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 15:23:44,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:44,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-12-07 15:23:44,154 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|], 2=[|v_#memory_int_43|]} [2019-12-07 15:23:44,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:44,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:44,171 INFO L377 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 27 treesize of output 11 [2019-12-07 15:23:44,171 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,180 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-12-07 15:23:44,207 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:44,208 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,212 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-12-07 15:23:44,249 INFO L377 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 20 [2019-12-07 15:23:44,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,256 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,256 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:20 [2019-12-07 15:23:44,259 INFO L377 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 19 treesize of output 18 [2019-12-07 15:23:44,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,265 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,265 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:44,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,290 INFO L377 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 11 treesize of output 15 [2019-12-07 15:23:44,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 15:23:44,319 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|], 6=[|v_#memory_int_46|]} [2019-12-07 15:23:44,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:44,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:44,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 15:23:44,338 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,345 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-12-07 15:23:44,371 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:44,371 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,377 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:44,377 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2019-12-07 15:23:44,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 26 treesize of output 52 [2019-12-07 15:23:44,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,459 INFO L614 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-12-07 15:23:44,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:44,460 INFO L534 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. [2019-12-07 15:23:44,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:41 [2019-12-07 15:23:44,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:44,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:44,541 INFO L377 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 22 treesize of output 10 [2019-12-07 15:23:44,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:44,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:44,544 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-12-07 15:23:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:44,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:44,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-12-07 15:23:44,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472774123] [2019-12-07 15:23:44,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 15:23:44,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:44,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 15:23:44,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-12-07 15:23:44,554 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand 32 states. [2019-12-07 15:23:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:45,807 INFO L93 Difference]: Finished difference Result 360 states and 409 transitions. [2019-12-07 15:23:45,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 15:23:45,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-12-07 15:23:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:45,809 INFO L225 Difference]: With dead ends: 360 [2019-12-07 15:23:45,809 INFO L226 Difference]: Without dead ends: 360 [2019-12-07 15:23:45,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=454, Invalid=2302, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 15:23:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-07 15:23:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 221. [2019-12-07 15:23:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-07 15:23:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 258 transitions. [2019-12-07 15:23:45,814 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 258 transitions. Word has length 47 [2019-12-07 15:23:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:45,814 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 258 transitions. [2019-12-07 15:23:45,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 15:23:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 258 transitions. [2019-12-07 15:23:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 15:23:45,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:45,815 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:46,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:46,016 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash -223146892, now seen corresponding path program 2 times [2019-12-07 15:23:46,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:46,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121476493] [2019-12-07 15:23:46,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:46,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121476493] [2019-12-07 15:23:46,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300483885] [2019-12-07 15:23:46,272 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:46,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:23:46,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:23:46,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 15:23:46,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:46,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:46,361 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,367 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,367 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2019-12-07 15:23:46,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-12-07 15:23:46,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:46,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:46,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:46,379 INFO L377 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 0 case distinctions, treesize of input 16 treesize of output 20 [2019-12-07 15:23:46,379 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,382 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,389 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,389 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2019-12-07 15:23:46,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,421 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:23:46,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,441 INFO L614 ElimStorePlain]: treesize reduction 14, result has 74.1 percent of original size [2019-12-07 15:23:46,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:40 [2019-12-07 15:23:46,470 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|], 6=[|v_#memory_int_50|]} [2019-12-07 15:23:46,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:46,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:46,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:46,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:46,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 15:23:46,493 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,504 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:52 [2019-12-07 15:23:46,532 INFO L377 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 25 treesize of output 13 [2019-12-07 15:23:46,532 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-12-07 15:23:46,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-12-07 15:23:46,582 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,591 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,591 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2019-12-07 15:23:46,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 15:23:46,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,602 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-12-07 15:23:46,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,634 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 15:23:46,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2019-12-07 15:23:46,672 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_37|], 10=[|v_#memory_int_53|]} [2019-12-07 15:23:46,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:46,675 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:46,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-12-07 15:23:46,696 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,708 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:49 [2019-12-07 15:23:46,744 INFO L377 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 30 treesize of output 12 [2019-12-07 15:23:46,745 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:46,753 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:37 [2019-12-07 15:23:46,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-12-07 15:23:46,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,827 INFO L534 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. [2019-12-07 15:23:46,827 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:44 [2019-12-07 15:23:46,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2019-12-07 15:23:46,894 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:46,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:46,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:3 [2019-12-07 15:23:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:46,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:46,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 32 [2019-12-07 15:23:46,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668410661] [2019-12-07 15:23:46,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 15:23:46,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:46,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 15:23:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2019-12-07 15:23:46,910 INFO L87 Difference]: Start difference. First operand 221 states and 258 transitions. Second operand 32 states. [2019-12-07 15:23:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:49,964 INFO L93 Difference]: Finished difference Result 454 states and 513 transitions. [2019-12-07 15:23:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 15:23:49,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-12-07 15:23:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:49,966 INFO L225 Difference]: With dead ends: 454 [2019-12-07 15:23:49,967 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 15:23:49,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=757, Invalid=3665, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 15:23:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 15:23:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 221. [2019-12-07 15:23:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-07 15:23:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 256 transitions. [2019-12-07 15:23:49,971 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 256 transitions. Word has length 47 [2019-12-07 15:23:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:49,971 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 256 transitions. [2019-12-07 15:23:49,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 15:23:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 256 transitions. [2019-12-07 15:23:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 15:23:49,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:49,972 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:50,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:50,173 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash -516561964, now seen corresponding path program 1 times [2019-12-07 15:23:50,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:50,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026167753] [2019-12-07 15:23:50,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:50,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026167753] [2019-12-07 15:23:50,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124987217] [2019-12-07 15:23:50,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:50,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 15:23:50,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:50,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:23:50,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:23:50,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:50,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 15:23:50,519 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|], 2=[|v_#memory_int_56|]} [2019-12-07 15:23:50,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:50,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,534 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:50,536 INFO L377 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 27 treesize of output 11 [2019-12-07 15:23:50,537 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,547 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,547 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:37 [2019-12-07 15:23:50,574 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:50,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-12-07 15:23:50,626 INFO L377 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 20 [2019-12-07 15:23:50,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-12-07 15:23:50,637 INFO L377 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 19 treesize of output 18 [2019-12-07 15:23:50,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 15:23:50,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,678 INFO L377 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 11 treesize of output 15 [2019-12-07 15:23:50,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2019-12-07 15:23:50,709 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_39|], 6=[|v_#memory_int_59|]} [2019-12-07 15:23:50,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:50,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:23:50,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 15:23:50,725 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,734 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:37 [2019-12-07 15:23:50,763 INFO L377 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 20 treesize of output 8 [2019-12-07 15:23:50,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:50,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2019-12-07 15:23:50,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 26 treesize of output 52 [2019-12-07 15:23:50,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,860 INFO L614 ElimStorePlain]: treesize reduction 16, result has 74.2 percent of original size [2019-12-07 15:23:50,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:50,861 INFO L534 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. [2019-12-07 15:23:50,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:46 [2019-12-07 15:23:50,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:50,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:50,968 INFO L377 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 22 treesize of output 10 [2019-12-07 15:23:50,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:50,973 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:50,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-12-07 15:23:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:50,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:50,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2019-12-07 15:23:50,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947260914] [2019-12-07 15:23:50,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 15:23:50,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 15:23:50,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 15:23:50,988 INFO L87 Difference]: Start difference. First operand 221 states and 256 transitions. Second operand 33 states. [2019-12-07 15:23:52,646 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-12-07 15:23:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:53,284 INFO L93 Difference]: Finished difference Result 366 states and 413 transitions. [2019-12-07 15:23:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 15:23:53,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2019-12-07 15:23:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:53,287 INFO L225 Difference]: With dead ends: 366 [2019-12-07 15:23:53,287 INFO L226 Difference]: Without dead ends: 366 [2019-12-07 15:23:53,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=467, Invalid=2395, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 15:23:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-12-07 15:23:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 221. [2019-12-07 15:23:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-07 15:23:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2019-12-07 15:23:53,293 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 254 transitions. Word has length 47 [2019-12-07 15:23:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:53,293 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 254 transitions. [2019-12-07 15:23:53,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 15:23:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 254 transitions. [2019-12-07 15:23:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:23:53,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:53,294 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-12-07 15:23:53,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:53,495 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1055670372, now seen corresponding path program 1 times [2019-12-07 15:23:53,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:53,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323247748] [2019-12-07 15:23:53,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:23:53,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323247748] [2019-12-07 15:23:53,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:23:53,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:23:53,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833135132] [2019-12-07 15:23:53,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:23:53,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:53,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:23:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:23:53,576 INFO L87 Difference]: Start difference. First operand 221 states and 254 transitions. Second operand 6 states. [2019-12-07 15:23:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:54,218 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2019-12-07 15:23:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:23:54,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 15:23:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:54,222 INFO L225 Difference]: With dead ends: 220 [2019-12-07 15:23:54,222 INFO L226 Difference]: Without dead ends: 220 [2019-12-07 15:23:54,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:23:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-07 15:23:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-12-07 15:23:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 15:23:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 251 transitions. [2019-12-07 15:23:54,231 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 251 transitions. Word has length 49 [2019-12-07 15:23:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:54,232 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 251 transitions. [2019-12-07 15:23:54,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:23:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 251 transitions. [2019-12-07 15:23:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:23:54,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:54,233 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:54,234 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash 600024193, now seen corresponding path program 2 times [2019-12-07 15:23:54,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:54,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562358625] [2019-12-07 15:23:54,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:54,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562358625] [2019-12-07 15:23:54,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545740139] [2019-12-07 15:23:54,427 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:54,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:23:54,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:23:54,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 15:23:54,502 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:54,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:23:54,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,531 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 15:23:54,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:54,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,540 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-12-07 15:23:54,548 INFO L377 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 29 treesize of output 13 [2019-12-07 15:23:54,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,553 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-12-07 15:23:54,555 INFO L377 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 25 treesize of output 13 [2019-12-07 15:23:54,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,561 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-12-07 15:23:54,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,566 INFO L377 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 11 treesize of output 15 [2019-12-07 15:23:54,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,571 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-12-07 15:23:54,591 INFO L377 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 23 treesize of output 22 [2019-12-07 15:23:54,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2019-12-07 15:23:54,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,702 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-12-07 15:23:54,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:54,716 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 13 xjuncts. [2019-12-07 15:23:54,862 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2019-12-07 15:23:54,862 INFO L614 ElimStorePlain]: treesize reduction 2036, result has 3.3 percent of original size [2019-12-07 15:23:54,863 INFO L534 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. [2019-12-07 15:23:54,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:65 [2019-12-07 15:23:54,916 INFO L377 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 25 treesize of output 13 [2019-12-07 15:23:54,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:54,919 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:54,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-12-07 15:23:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:54,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:54,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 24 [2019-12-07 15:23:54,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021610590] [2019-12-07 15:23:54,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 15:23:54,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:54,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 15:23:54,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-12-07 15:23:54,928 INFO L87 Difference]: Start difference. First operand 219 states and 251 transitions. Second operand 25 states. [2019-12-07 15:23:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:55,860 INFO L93 Difference]: Finished difference Result 334 states and 382 transitions. [2019-12-07 15:23:55,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 15:23:55,860 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2019-12-07 15:23:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:55,861 INFO L225 Difference]: With dead ends: 334 [2019-12-07 15:23:55,862 INFO L226 Difference]: Without dead ends: 334 [2019-12-07 15:23:55,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 15:23:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-12-07 15:23:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 233. [2019-12-07 15:23:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 15:23:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2019-12-07 15:23:55,866 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 49 [2019-12-07 15:23:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:55,866 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2019-12-07 15:23:55,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 15:23:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2019-12-07 15:23:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:23:55,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:55,867 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:23:56,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:56,068 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:23:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 600024194, now seen corresponding path program 2 times [2019-12-07 15:23:56,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:23:56,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586395594] [2019-12-07 15:23:56,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:23:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:23:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:56,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586395594] [2019-12-07 15:23:56,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971333449] [2019-12-07 15:23:56,397 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:56,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:23:56,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:23:56,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 15:23:56,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:56,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,499 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:23:56,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,517 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 15:23:56,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 15:23:56,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:56,544 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:23:56,558 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,568 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2019-12-07 15:23:56,663 INFO L343 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2019-12-07 15:23:56,663 INFO L377 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 1 case distinctions, treesize of input 50 treesize of output 34 [2019-12-07 15:23:56,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,683 INFO L614 ElimStorePlain]: treesize reduction 12, result has 82.1 percent of original size [2019-12-07 15:23:56,685 INFO L377 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 29 treesize of output 13 [2019-12-07 15:23:56,685 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,692 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,692 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:36 [2019-12-07 15:23:56,729 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-12-07 15:23:56,729 INFO L377 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 1 case distinctions, treesize of input 46 treesize of output 32 [2019-12-07 15:23:56,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,751 INFO L614 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-12-07 15:23:56,754 INFO L377 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 25 treesize of output 13 [2019-12-07 15:23:56,754 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-12-07 15:23:56,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,791 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-12-07 15:23:56,792 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:46 [2019-12-07 15:23:56,849 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,849 INFO L377 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 1 case distinctions, treesize of input 43 treesize of output 64 [2019-12-07 15:23:56,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,881 INFO L614 ElimStorePlain]: treesize reduction 34, result has 66.7 percent of original size [2019-12-07 15:23:56,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 15:23:56,884 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:56,897 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:56,898 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:58 [2019-12-07 15:23:57,017 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|], 6=[|v_#memory_$Pointer$.base_49|]} [2019-12-07 15:23:57,020 INFO L377 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 61 treesize of output 13 [2019-12-07 15:23:57,020 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:57,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:57,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:57,064 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 139 [2019-12-07 15:23:57,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:57,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:57,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:57,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:57,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:57,066 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:57,101 INFO L614 ElimStorePlain]: treesize reduction 581, result has 12.0 percent of original size [2019-12-07 15:23:57,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:57,101 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:181, output treesize:79 [2019-12-07 15:23:57,198 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-12-07 15:23:57,202 INFO L377 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 15 treesize of output 7 [2019-12-07 15:23:57,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:57,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:57,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:57,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 [2019-12-07 15:23:57,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:23:57,221 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:57,231 INFO L614 ElimStorePlain]: treesize reduction 11, result has 64.5 percent of original size [2019-12-07 15:23:57,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:57,232 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:9 [2019-12-07 15:23:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:23:57,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:23:57,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2019-12-07 15:23:57,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234331466] [2019-12-07 15:23:57,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 15:23:57,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:23:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 15:23:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-12-07 15:23:57,278 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand 31 states. [2019-12-07 15:23:58,970 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-12-07 15:23:59,269 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 15:23:59,493 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-12-07 15:24:00,257 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-12-07 15:24:00,705 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-07 15:24:01,899 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-07 15:24:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:03,725 INFO L93 Difference]: Finished difference Result 374 states and 423 transitions. [2019-12-07 15:24:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 15:24:03,725 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2019-12-07 15:24:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:03,727 INFO L225 Difference]: With dead ends: 374 [2019-12-07 15:24:03,727 INFO L226 Difference]: Without dead ends: 374 [2019-12-07 15:24:03,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 15:24:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-07 15:24:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 238. [2019-12-07 15:24:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-12-07 15:24:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 275 transitions. [2019-12-07 15:24:03,730 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 275 transitions. Word has length 49 [2019-12-07 15:24:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:03,731 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 275 transitions. [2019-12-07 15:24:03,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 15:24:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 275 transitions. [2019-12-07 15:24:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 15:24:03,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:03,731 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 15:24:03,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:03,932 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash -272163447, now seen corresponding path program 1 times [2019-12-07 15:24:03,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:03,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734708299] [2019-12-07 15:24:03,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:04,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734708299] [2019-12-07 15:24:04,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127833245] [2019-12-07 15:24:04,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:04,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 15:24:04,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:04,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:04,188 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:24:04,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:04,203 INFO L614 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-12-07 15:24:04,203 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:04,203 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-12-07 15:24:04,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:04,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:04,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:04,230 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:04,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2019-12-07 15:24:04,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:04,308 INFO L377 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 1 case distinctions, treesize of input 55 treesize of output 67 [2019-12-07 15:24:04,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:04,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:04,322 INFO L614 ElimStorePlain]: treesize reduction 36, result has 47.8 percent of original size [2019-12-07 15:24:04,322 INFO L534 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. [2019-12-07 15:24:04,322 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:33 [2019-12-07 15:24:04,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:04,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2019-12-07 15:24:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:04,383 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:04,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:04,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:04,392 INFO L534 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. [2019-12-07 15:24:04,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2019-12-07 15:24:04,487 INFO L377 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 0 case distinctions, treesize of input 17 treesize of output 17 [2019-12-07 15:24:04,488 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:04,493 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 15:24:04,493 INFO L534 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. [2019-12-07 15:24:04,493 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 15:24:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 15:24:04,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:04,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2019-12-07 15:24:04,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145513389] [2019-12-07 15:24:04,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 15:24:04,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 15:24:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-12-07 15:24:04,525 INFO L87 Difference]: Start difference. First operand 238 states and 275 transitions. Second operand 29 states. [2019-12-07 15:24:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:05,858 INFO L93 Difference]: Finished difference Result 281 states and 320 transitions. [2019-12-07 15:24:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 15:24:05,859 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2019-12-07 15:24:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:05,860 INFO L225 Difference]: With dead ends: 281 [2019-12-07 15:24:05,860 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 15:24:05,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=1856, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 15:24:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 15:24:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 246. [2019-12-07 15:24:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 15:24:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2019-12-07 15:24:05,864 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 50 [2019-12-07 15:24:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:05,864 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2019-12-07 15:24:05,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 15:24:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2019-12-07 15:24:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 15:24:05,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:05,864 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 15:24:06,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:06,065 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash -272163446, now seen corresponding path program 1 times [2019-12-07 15:24:06,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:06,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724992567] [2019-12-07 15:24:06,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:06,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724992567] [2019-12-07 15:24:06,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740304549] [2019-12-07 15:24:06,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:06,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 15:24:06,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:06,412 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_42|], 1=[|v_#valid_78|]} [2019-12-07 15:24:06,414 INFO L377 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 [2019-12-07 15:24:06,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:24:06,427 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,433 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-12-07 15:24:06,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:06,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:06,462 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,470 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2019-12-07 15:24:06,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,553 INFO L377 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 1 case distinctions, treesize of input 88 treesize of output 82 [2019-12-07 15:24:06,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:06,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,582 INFO L614 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-12-07 15:24:06,586 INFO L377 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 43 treesize of output 13 [2019-12-07 15:24:06,587 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:06,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:06,600 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:37 [2019-12-07 15:24:06,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2019-12-07 15:24:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:06,733 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:06,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 15:24:06,751 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 15:24:06,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:06,763 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 15:24:06,763 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 [2019-12-07 15:24:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 15:24:06,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:06,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2019-12-07 15:24:06,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251609931] [2019-12-07 15:24:06,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 15:24:06,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 15:24:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-12-07 15:24:06,839 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand 30 states. [2019-12-07 15:24:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:08,102 INFO L93 Difference]: Finished difference Result 294 states and 330 transitions. [2019-12-07 15:24:08,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 15:24:08,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 50 [2019-12-07 15:24:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:08,104 INFO L225 Difference]: With dead ends: 294 [2019-12-07 15:24:08,104 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 15:24:08,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 15:24:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 15:24:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 251. [2019-12-07 15:24:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 15:24:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 289 transitions. [2019-12-07 15:24:08,107 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 289 transitions. Word has length 50 [2019-12-07 15:24:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:08,107 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 289 transitions. [2019-12-07 15:24:08,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 15:24:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 289 transitions. [2019-12-07 15:24:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:24:08,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:08,108 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:24:08,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:08,309 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash -452868153, now seen corresponding path program 2 times [2019-12-07 15:24:08,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:08,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360888089] [2019-12-07 15:24:08,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:08,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360888089] [2019-12-07 15:24:08,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140685455] [2019-12-07 15:24:08,506 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:08,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:24:08,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:24:08,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 15:24:08,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:08,576 INFO L377 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 [2019-12-07 15:24:08,576 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,579 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 15:24:08,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:24:08,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 15:24:08,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:08,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,653 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2019-12-07 15:24:08,731 INFO L343 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-12-07 15:24:08,731 INFO L377 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 1 case distinctions, treesize of input 43 treesize of output 29 [2019-12-07 15:24:08,731 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,742 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 15:24:08,742 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,742 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:21 [2019-12-07 15:24:08,771 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-12-07 15:24:08,771 INFO L377 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 1 case distinctions, treesize of input 39 treesize of output 27 [2019-12-07 15:24:08,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,782 INFO L614 ElimStorePlain]: treesize reduction 8, result has 72.4 percent of original size [2019-12-07 15:24:08,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:21 [2019-12-07 15:24:08,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:24:08,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,807 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,807 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-12-07 15:24:08,844 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,844 INFO L377 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 1 case distinctions, treesize of input 37 treesize of output 56 [2019-12-07 15:24:08,845 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,859 INFO L614 ElimStorePlain]: treesize reduction 28, result has 50.9 percent of original size [2019-12-07 15:24:08,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:08,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-12-07 15:24:08,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:08,978 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 122 [2019-12-07 15:24:08,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:08,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:08,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-12-07 15:24:09,087 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2019-12-07 15:24:09,088 INFO L614 ElimStorePlain]: treesize reduction 1561, result has 3.3 percent of original size [2019-12-07 15:24:09,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 15:24:09,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:49 [2019-12-07 15:24:09,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:09,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 15:24:09,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:09,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:24:09,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:09,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 15:24:09,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-12-07 15:24:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:09,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:09,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-12-07 15:24:09,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125126381] [2019-12-07 15:24:09,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 15:24:09,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 15:24:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2019-12-07 15:24:09,216 INFO L87 Difference]: Start difference. First operand 251 states and 289 transitions. Second operand 32 states. [2019-12-07 15:24:10,385 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-12-07 15:24:10,621 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-12-07 15:24:11,720 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-07 15:24:12,353 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 15:24:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:13,666 INFO L93 Difference]: Finished difference Result 434 states and 487 transitions. [2019-12-07 15:24:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 15:24:13,666 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 52 [2019-12-07 15:24:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:13,668 INFO L225 Difference]: With dead ends: 434 [2019-12-07 15:24:13,668 INFO L226 Difference]: Without dead ends: 434 [2019-12-07 15:24:13,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=727, Invalid=4529, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 15:24:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-07 15:24:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 276. [2019-12-07 15:24:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-07 15:24:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 328 transitions. [2019-12-07 15:24:13,673 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 328 transitions. Word has length 52 [2019-12-07 15:24:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:13,673 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 328 transitions. [2019-12-07 15:24:13,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 15:24:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 328 transitions. [2019-12-07 15:24:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:24:13,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:13,673 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:24:13,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:13,874 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash 877133912, now seen corresponding path program 1 times [2019-12-07 15:24:13,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:13,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147217968] [2019-12-07 15:24:13,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:14,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147217968] [2019-12-07 15:24:14,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429967670] [2019-12-07 15:24:14,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:14,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 15:24:14,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:14,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:14,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:24:14,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:14,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:14,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:14,267 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-12-07 15:24:14,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:14,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:14,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:14,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:14,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-12-07 15:24:14,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:14,328 INFO L377 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 1 case distinctions, treesize of input 55 treesize of output 67 [2019-12-07 15:24:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:14,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:24:14,342 INFO L614 ElimStorePlain]: treesize reduction 71, result has 26.0 percent of original size [2019-12-07 15:24:14,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:14,343 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-12-07 15:24:14,428 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:14,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 15:24:14,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:14,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:24:14,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:14,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 15:24:14,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2019-12-07 15:24:14,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:14,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 26 [2019-12-07 15:24:14,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573570937] [2019-12-07 15:24:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 15:24:14,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 15:24:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-12-07 15:24:14,470 INFO L87 Difference]: Start difference. First operand 276 states and 328 transitions. Second operand 27 states. [2019-12-07 15:24:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:15,956 INFO L93 Difference]: Finished difference Result 316 states and 365 transitions. [2019-12-07 15:24:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 15:24:15,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-12-07 15:24:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:15,958 INFO L225 Difference]: With dead ends: 316 [2019-12-07 15:24:15,958 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 15:24:15,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=414, Invalid=1842, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 15:24:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 15:24:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 274. [2019-12-07 15:24:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-07 15:24:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 326 transitions. [2019-12-07 15:24:15,962 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 326 transitions. Word has length 53 [2019-12-07 15:24:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:15,963 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 326 transitions. [2019-12-07 15:24:15,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 15:24:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 326 transitions. [2019-12-07 15:24:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:24:15,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:15,963 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 15:24:16,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:16,164 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1818546646, now seen corresponding path program 2 times [2019-12-07 15:24:16,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:16,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816035143] [2019-12-07 15:24:16,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:16,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816035143] [2019-12-07 15:24:16,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853400495] [2019-12-07 15:24:16,585 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:16,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:24:16,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:24:16,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-07 15:24:16,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:16,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,688 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:24:16,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,704 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 15:24:16,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 15:24:16,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:16,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:16,747 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,757 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,757 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2019-12-07 15:24:16,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:16,853 INFO L377 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 34 treesize of output 14 [2019-12-07 15:24:16,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:16,869 INFO L377 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 44 treesize of output 20 [2019-12-07 15:24:16,870 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,879 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-07 15:24:16,913 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_61|], 2=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_63|]} [2019-12-07 15:24:16,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:24:16,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:16,936 INFO L377 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 23 treesize of output 11 [2019-12-07 15:24:16,936 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:16,953 INFO L377 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 40 treesize of output 20 [2019-12-07 15:24:16,953 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,963 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:16,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:16,964 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:89, output treesize:55 [2019-12-07 15:24:17,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,009 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 15:24:17,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,019 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2019-12-07 15:24:17,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:17,061 INFO L377 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 21 treesize of output 20 [2019-12-07 15:24:17,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,095 INFO L377 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 1 case distinctions, treesize of input 37 treesize of output 56 [2019-12-07 15:24:17,095 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,133 INFO L614 ElimStorePlain]: treesize reduction 28, result has 74.5 percent of original size [2019-12-07 15:24:17,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:17,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 15:24:17,136 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,150 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:98, output treesize:57 [2019-12-07 15:24:17,266 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_35|, |v_#memory_int_63|], 6=[|v_#memory_$Pointer$.base_65|]} [2019-12-07 15:24:17,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,277 INFO L377 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 1 case distinctions, treesize of input 225 treesize of output 207 [2019-12-07 15:24:17,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:24:17,328 INFO L614 ElimStorePlain]: treesize reduction 367, result has 32.8 percent of original size [2019-12-07 15:24:17,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2019-12-07 15:24:17,331 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,374 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2019-12-07 15:24:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:17,379 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 11 xjuncts. [2019-12-07 15:24:17,457 INFO L614 ElimStorePlain]: treesize reduction 1939, result has 5.1 percent of original size [2019-12-07 15:24:17,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:17,457 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:236, output treesize:104 [2019-12-07 15:24:17,557 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-12-07 15:24:17,559 INFO L377 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 100 treesize of output 72 [2019-12-07 15:24:17,559 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 47 [2019-12-07 15:24:17,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:17,575 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:17,592 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-12-07 15:24:17,592 INFO L534 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. [2019-12-07 15:24:17,592 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:27 [2019-12-07 15:24:17,656 INFO L377 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 22 treesize of output 10 [2019-12-07 15:24:17,656 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:17,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:17,660 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-12-07 15:24:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:17,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:17,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2019-12-07 15:24:17,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518928170] [2019-12-07 15:24:17,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 15:24:17,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:17,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 15:24:17,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 15:24:17,679 INFO L87 Difference]: Start difference. First operand 274 states and 326 transitions. Second operand 35 states. [2019-12-07 15:24:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:20,717 INFO L93 Difference]: Finished difference Result 444 states and 512 transitions. [2019-12-07 15:24:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 15:24:20,718 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 55 [2019-12-07 15:24:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:20,719 INFO L225 Difference]: With dead ends: 444 [2019-12-07 15:24:20,719 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 15:24:20,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=377, Invalid=2485, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 15:24:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 15:24:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 312. [2019-12-07 15:24:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-12-07 15:24:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 369 transitions. [2019-12-07 15:24:20,724 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 369 transitions. Word has length 55 [2019-12-07 15:24:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:20,724 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 369 transitions. [2019-12-07 15:24:20,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 15:24:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 369 transitions. [2019-12-07 15:24:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:24:20,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:20,724 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:24:20,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:20,925 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1818854476, now seen corresponding path program 1 times [2019-12-07 15:24:20,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:20,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278034380] [2019-12-07 15:24:20,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:21,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278034380] [2019-12-07 15:24:21,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299560519] [2019-12-07 15:24:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:21,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-07 15:24:21,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:21,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:21,489 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:24:21,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,506 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 15:24:21,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 15:24:21,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:21,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:21,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:21,556 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:21,570 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,570 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2019-12-07 15:24:21,723 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_64|], 2=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_37|]} [2019-12-07 15:24:21,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:21,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:21,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:21,768 INFO L377 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 44 treesize of output 20 [2019-12-07 15:24:21,768 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:21,797 INFO L377 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 34 treesize of output 14 [2019-12-07 15:24:21,797 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:21,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:21,815 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:98, output treesize:39 [2019-12-07 15:24:22,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:22,175 INFO L377 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 40 treesize of output 20 [2019-12-07 15:24:22,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:22,260 INFO L377 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 30 treesize of output 14 [2019-12-07 15:24:22,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:22,333 INFO L377 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 20 [2019-12-07 15:24:22,333 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,389 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,390 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:66 [2019-12-07 15:24:22,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,545 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 15:24:22,545 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:64 [2019-12-07 15:24:22,609 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_69|, |v_#memory_$Pointer$.offset_39|], 6=[|v_#memory_int_66|]} [2019-12-07 15:24:22,614 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:22,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,621 INFO L377 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 1 case distinctions, treesize of input 37 treesize of output 44 [2019-12-07 15:24:22,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,680 INFO L614 ElimStorePlain]: treesize reduction 20, result has 82.3 percent of original size [2019-12-07 15:24:22,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,695 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 51 [2019-12-07 15:24:22,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:22,696 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,747 INFO L614 ElimStorePlain]: treesize reduction 32, result has 73.6 percent of original size [2019-12-07 15:24:22,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:22,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:22,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:22,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 15:24:22,752 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:22,768 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,769 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:109, output treesize:64 [2019-12-07 15:24:22,962 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_40|], 6=[|v_#memory_$Pointer$.base_70|, |v_#memory_int_67|]} [2019-12-07 15:24:22,966 INFO L377 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 60 treesize of output 14 [2019-12-07 15:24:22,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:22,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:23,001 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:23,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:23,043 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 139 [2019-12-07 15:24:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:23,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:23,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,049 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 15:24:23,213 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-12-07 15:24:23,213 INFO L614 ElimStorePlain]: treesize reduction 1104, result has 8.9 percent of original size [2019-12-07 15:24:23,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:23,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2019-12-07 15:24:23,219 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:23,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:23,241 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:23,242 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:198, output treesize:94 [2019-12-07 15:24:23,412 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-12-07 15:24:23,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:23,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 15:24:23,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:23,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:23,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:23,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:23,454 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-12-07 15:24:23,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 49 [2019-12-07 15:24:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:23,456 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:23,482 INFO L614 ElimStorePlain]: treesize reduction 4, result has 92.7 percent of original size [2019-12-07 15:24:23,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:23,483 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:115, output treesize:37 [2019-12-07 15:24:23,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:23,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:23,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:23,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 15:24:23,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:23,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:23,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:23,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:3 [2019-12-07 15:24:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:23,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:23,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 42 [2019-12-07 15:24:23,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926356113] [2019-12-07 15:24:23,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 15:24:23,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:23,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 15:24:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 15:24:23,683 INFO L87 Difference]: Start difference. First operand 312 states and 369 transitions. Second operand 42 states. [2019-12-07 15:24:26,046 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 15:24:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:28,210 INFO L93 Difference]: Finished difference Result 420 states and 487 transitions. [2019-12-07 15:24:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 15:24:28,211 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2019-12-07 15:24:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:28,212 INFO L225 Difference]: With dead ends: 420 [2019-12-07 15:24:28,212 INFO L226 Difference]: Without dead ends: 420 [2019-12-07 15:24:28,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=439, Invalid=3101, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 15:24:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-12-07 15:24:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 310. [2019-12-07 15:24:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-07 15:24:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 366 transitions. [2019-12-07 15:24:28,216 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 366 transitions. Word has length 55 [2019-12-07 15:24:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:28,217 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 366 transitions. [2019-12-07 15:24:28,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 15:24:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 366 transitions. [2019-12-07 15:24:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:24:28,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:28,217 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:24:28,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:28,418 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1808218826, now seen corresponding path program 1 times [2019-12-07 15:24:28,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:28,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203176363] [2019-12-07 15:24:28,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:28,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203176363] [2019-12-07 15:24:28,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596705051] [2019-12-07 15:24:28,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:29,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 73 conjunts are in the unsatisfiable core [2019-12-07 15:24:29,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:29,088 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_43|], 3=[|v_#valid_87|]} [2019-12-07 15:24:29,090 INFO L377 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 [2019-12-07 15:24:29,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,109 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:24:29,110 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,129 INFO L614 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-12-07 15:24:29,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,129 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-12-07 15:24:29,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:29,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:29,172 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,184 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:56 [2019-12-07 15:24:29,276 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_68|], 2=[|v_#memory_$Pointer$.base_72|, |v_#memory_$Pointer$.offset_42|]} [2019-12-07 15:24:29,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:29,280 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,309 INFO L377 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 61 treesize of output 27 [2019-12-07 15:24:29,309 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,326 INFO L377 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 38 treesize of output 16 [2019-12-07 15:24:29,326 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,338 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,338 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:119, output treesize:50 [2019-12-07 15:24:29,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,440 INFO L377 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 34 treesize of output 16 [2019-12-07 15:24:29,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,465 INFO L377 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 57 treesize of output 27 [2019-12-07 15:24:29,466 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,485 INFO L377 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 22 treesize of output 21 [2019-12-07 15:24:29,485 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,499 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,499 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:122, output treesize:70 [2019-12-07 15:24:29,548 INFO L430 ElimStorePlain]: Different costs {1=[|v_#length_44|], 3=[|v_#valid_88|]} [2019-12-07 15:24:29,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,552 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 15:24:29,552 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,581 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 15:24:29,581 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,597 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:73 [2019-12-07 15:24:29,645 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_74|], 6=[|v_#memory_int_70|]} [2019-12-07 15:24:29,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-12-07 15:24:29,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 15:24:29,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,726 INFO L614 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2019-12-07 15:24:29,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-07 15:24:29,731 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:29,749 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:118, output treesize:81 [2019-12-07 15:24:29,901 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|], 6=[|v_#memory_int_71|, |v_#memory_$Pointer$.base_75|]} [2019-12-07 15:24:29,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:29,915 INFO L377 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 1 case distinctions, treesize of input 318 treesize of output 270 [2019-12-07 15:24:29,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:29,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:29,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:29,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:29,917 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:24:29,993 INFO L614 ElimStorePlain]: treesize reduction 537, result has 32.9 percent of original size [2019-12-07 15:24:29,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:29,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 73 [2019-12-07 15:24:29,998 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:30,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:30,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:30,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:30,059 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 190 [2019-12-07 15:24:30,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:30,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:30,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:30,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:30,062 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:30,126 INFO L614 ElimStorePlain]: treesize reduction 603, result has 22.2 percent of original size [2019-12-07 15:24:30,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:30,127 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:332, output treesize:172 [2019-12-07 15:24:30,326 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-12-07 15:24:30,328 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:30,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 99 [2019-12-07 15:24:30,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:30,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:30,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:30,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:30,355 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-12-07 15:24:30,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 60 [2019-12-07 15:24:30,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:30,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:30,356 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:30,386 INFO L614 ElimStorePlain]: treesize reduction 4, result has 93.7 percent of original size [2019-12-07 15:24:30,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:30,387 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:161, output treesize:45 [2019-12-07 15:24:30,489 INFO L377 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 18 treesize of output 12 [2019-12-07 15:24:30,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:30,506 INFO L614 ElimStorePlain]: treesize reduction 3, result has 93.6 percent of original size [2019-12-07 15:24:30,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:30,508 INFO L377 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 0 case distinctions, treesize of input 34 treesize of output 14 [2019-12-07 15:24:30,508 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:30,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:30,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:30,512 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:61, output treesize:4 [2019-12-07 15:24:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:30,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:30,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2019-12-07 15:24:30,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078857723] [2019-12-07 15:24:30,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 15:24:30,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 15:24:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 15:24:30,534 INFO L87 Difference]: Start difference. First operand 310 states and 366 transitions. Second operand 42 states. [2019-12-07 15:24:32,159 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-07 15:24:32,675 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 15:24:33,309 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-07 15:24:34,666 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-12-07 15:24:35,133 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-12-07 15:24:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:36,749 INFO L93 Difference]: Finished difference Result 442 states and 506 transitions. [2019-12-07 15:24:36,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 15:24:36,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2019-12-07 15:24:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:36,751 INFO L225 Difference]: With dead ends: 442 [2019-12-07 15:24:36,751 INFO L226 Difference]: Without dead ends: 442 [2019-12-07 15:24:36,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=590, Invalid=3442, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 15:24:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-07 15:24:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 308. [2019-12-07 15:24:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 15:24:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 362 transitions. [2019-12-07 15:24:36,755 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 362 transitions. Word has length 55 [2019-12-07 15:24:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:36,755 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 362 transitions. [2019-12-07 15:24:36,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 15:24:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 362 transitions. [2019-12-07 15:24:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:24:36,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:36,756 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:24:36,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:36,957 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1807910996, now seen corresponding path program 1 times [2019-12-07 15:24:36,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:36,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690819873] [2019-12-07 15:24:36,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:37,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690819873] [2019-12-07 15:24:37,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537315260] [2019-12-07 15:24:37,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:37,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 15:24:37,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:37,451 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_45|], 3=[|v_#valid_89|]} [2019-12-07 15:24:37,453 INFO L377 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 [2019-12-07 15:24:37,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,472 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 15:24:37,473 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,490 INFO L614 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-12-07 15:24:37,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,490 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-12-07 15:24:37,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:37,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:37,534 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,545 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,545 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 [2019-12-07 15:24:37,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:37,642 INFO L377 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 27 treesize of output 11 [2019-12-07 15:24:37,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,666 INFO L343 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-12-07 15:24:37,666 INFO L377 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 1 case distinctions, treesize of input 53 treesize of output 35 [2019-12-07 15:24:37,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,683 INFO L614 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-12-07 15:24:37,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,683 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:37 [2019-12-07 15:24:37,708 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_72|], 2=[|v_#memory_$Pointer$.base_78|, |v_#memory_$Pointer$.offset_48|]} [2019-12-07 15:24:37,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:24:37,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,741 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-12-07 15:24:37,741 INFO L377 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 1 case distinctions, treesize of input 49 treesize of output 33 [2019-12-07 15:24:37,741 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,769 INFO L614 ElimStorePlain]: treesize reduction 8, result has 88.6 percent of original size [2019-12-07 15:24:37,771 INFO L377 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 23 treesize of output 11 [2019-12-07 15:24:37,771 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,782 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:47 [2019-12-07 15:24:37,819 INFO L430 ElimStorePlain]: Different costs {1=[|v_#length_46|], 3=[|v_#valid_90|]} [2019-12-07 15:24:37,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:37,822 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 15:24:37,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,844 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,844 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 15:24:37,845 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,856 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2019-12-07 15:24:37,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 15:24:37,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 15:24:37,921 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:37,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 15:24:37,945 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:37,960 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:37,961 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:95, output treesize:68 [2019-12-07 15:24:38,092 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_50|, |v_#memory_int_74|], 6=[|v_#memory_$Pointer$.base_80|]} [2019-12-07 15:24:38,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:38,103 INFO L377 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 1 case distinctions, treesize of input 235 treesize of output 217 [2019-12-07 15:24:38,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:38,141 INFO L614 ElimStorePlain]: treesize reduction 48, result has 80.5 percent of original size [2019-12-07 15:24:38,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2019-12-07 15:24:38,144 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:38,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:38,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:38,188 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 170 [2019-12-07 15:24:38,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:38,200 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2019-12-07 15:24:38,302 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-12-07 15:24:38,302 INFO L614 ElimStorePlain]: treesize reduction 2355, result has 5.0 percent of original size [2019-12-07 15:24:38,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:38,303 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:255, output treesize:123 [2019-12-07 15:24:38,456 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-12-07 15:24:38,458 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:38,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 82 [2019-12-07 15:24:38,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:38,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:38,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:24:38,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:38,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 76 [2019-12-07 15:24:38,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:24:38,487 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:38,512 INFO L614 ElimStorePlain]: treesize reduction 30, result has 60.5 percent of original size [2019-12-07 15:24:38,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:38,512 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:144, output treesize:32 [2019-12-07 15:24:38,590 INFO L377 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 18 treesize of output 12 [2019-12-07 15:24:38,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:38,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:38,596 INFO L534 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. [2019-12-07 15:24:38,596 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-12-07 15:24:38,639 INFO L377 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 22 treesize of output 10 [2019-12-07 15:24:38,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:38,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:38,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:38,644 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-12-07 15:24:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:38,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:38,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2019-12-07 15:24:38,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271016364] [2019-12-07 15:24:38,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 15:24:38,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:38,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 15:24:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 15:24:38,673 INFO L87 Difference]: Start difference. First operand 308 states and 362 transitions. Second operand 38 states. [2019-12-07 15:24:41,133 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-12-07 15:24:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:42,189 INFO L93 Difference]: Finished difference Result 438 states and 502 transitions. [2019-12-07 15:24:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 15:24:42,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 55 [2019-12-07 15:24:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:42,191 INFO L225 Difference]: With dead ends: 438 [2019-12-07 15:24:42,191 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 15:24:42,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=486, Invalid=2936, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 15:24:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 15:24:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 308. [2019-12-07 15:24:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 15:24:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 361 transitions. [2019-12-07 15:24:42,195 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 361 transitions. Word has length 55 [2019-12-07 15:24:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:42,195 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 361 transitions. [2019-12-07 15:24:42,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 15:24:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2019-12-07 15:24:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:24:42,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:42,196 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:24:42,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:42,397 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1452544430, now seen corresponding path program 1 times [2019-12-07 15:24:42,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:42,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059989447] [2019-12-07 15:24:42,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:24:42,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059989447] [2019-12-07 15:24:42,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166406825] [2019-12-07 15:24:42,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:42,631 INFO L264 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 15:24:42,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:42,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2019-12-07 15:24:42,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:24:42,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 15:24:42,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 15:24:42,751 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_81|], 2=[|v_#memory_int_76|]} [2019-12-07 15:24:42,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:42,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:42,768 INFO L377 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 27 treesize of output 11 [2019-12-07 15:24:42,768 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,777 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:37 [2019-12-07 15:24:42,804 INFO L377 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 20 treesize of output 8 [2019-12-07 15:24:42,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,810 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-12-07 15:24:42,849 INFO L377 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 20 [2019-12-07 15:24:42,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,857 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-12-07 15:24:42,859 INFO L377 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 19 treesize of output 18 [2019-12-07 15:24:42,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 15:24:42,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,893 INFO L377 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 11 treesize of output 15 [2019-12-07 15:24:42,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2019-12-07 15:24:42,923 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_82|], 6=[|v_#memory_int_79|]} [2019-12-07 15:24:42,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:42,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:24:42,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 15:24:42,939 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,947 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:37 [2019-12-07 15:24:42,975 INFO L377 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 20 treesize of output 8 [2019-12-07 15:24:42,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:42,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:42,982 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:42,982 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2019-12-07 15:24:43,051 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:43,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 26 treesize of output 52 [2019-12-07 15:24:43,051 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:43,075 INFO L614 ElimStorePlain]: treesize reduction 16, result has 74.2 percent of original size [2019-12-07 15:24:43,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:43,076 INFO L534 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. [2019-12-07 15:24:43,076 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:46 [2019-12-07 15:24:43,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:43,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:43,158 INFO L377 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 22 treesize of output 10 [2019-12-07 15:24:43,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:43,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:43,163 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:43,163 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-12-07 15:24:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:24:43,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:43,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2019-12-07 15:24:43,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971857782] [2019-12-07 15:24:43,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 15:24:43,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:43,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 15:24:43,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 15:24:43,174 INFO L87 Difference]: Start difference. First operand 308 states and 361 transitions. Second operand 33 states. [2019-12-07 15:24:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:44,524 INFO L93 Difference]: Finished difference Result 432 states and 490 transitions. [2019-12-07 15:24:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 15:24:44,524 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2019-12-07 15:24:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:44,526 INFO L225 Difference]: With dead ends: 432 [2019-12-07 15:24:44,526 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 15:24:44,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 15:24:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 15:24:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 307. [2019-12-07 15:24:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-07 15:24:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 356 transitions. [2019-12-07 15:24:44,529 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 356 transitions. Word has length 55 [2019-12-07 15:24:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:44,529 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 356 transitions. [2019-12-07 15:24:44,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 15:24:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 356 transitions. [2019-12-07 15:24:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:24:44,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:44,530 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:24:44,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:44,731 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash 115552127, now seen corresponding path program 1 times [2019-12-07 15:24:44,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:44,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633853938] [2019-12-07 15:24:44,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:24:45,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633853938] [2019-12-07 15:24:45,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279852224] [2019-12-07 15:24:45,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:24:45,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 15:24:45,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:24:45,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 15:24:45,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:45,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:45,430 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:24:45,430 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2019-12-07 15:24:45,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:45,542 INFO L377 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 1 case distinctions, treesize of input 63 treesize of output 75 [2019-12-07 15:24:45,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:45,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:24:45,555 INFO L614 ElimStorePlain]: treesize reduction 36, result has 53.2 percent of original size [2019-12-07 15:24:45,556 INFO L534 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. [2019-12-07 15:24:45,556 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:41 [2019-12-07 15:24:45,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:45,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2019-12-07 15:24:45,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:45,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:45,654 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:24:45,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:24:45,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:24:45,668 INFO L534 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. [2019-12-07 15:24:45,668 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:52 [2019-12-07 15:24:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 15:24:46,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:24:46,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2019-12-07 15:24:46,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109515661] [2019-12-07 15:24:46,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 15:24:46,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:24:46,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 15:24:46,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 15:24:46,254 INFO L87 Difference]: Start difference. First operand 307 states and 356 transitions. Second operand 33 states. [2019-12-07 15:24:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:24:48,156 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2019-12-07 15:24:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:24:48,156 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 56 [2019-12-07 15:24:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:24:48,158 INFO L225 Difference]: With dead ends: 332 [2019-12-07 15:24:48,158 INFO L226 Difference]: Without dead ends: 327 [2019-12-07 15:24:48,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=255, Invalid=1815, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 15:24:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-07 15:24:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 303. [2019-12-07 15:24:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-07 15:24:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 351 transitions. [2019-12-07 15:24:48,161 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 351 transitions. Word has length 56 [2019-12-07 15:24:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:24:48,161 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 351 transitions. [2019-12-07 15:24:48,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 15:24:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 351 transitions. [2019-12-07 15:24:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 15:24:48,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:24:48,162 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 15:24:48,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:24:48,363 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr44ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:24:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:24:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 648942030, now seen corresponding path program 2 times [2019-12-07 15:24:48,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:24:48,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317911111] [2019-12-07 15:24:48,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:24:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:24:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:24:48,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:24:48,404 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:24:48,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:24:48 BoogieIcfgContainer [2019-12-07 15:24:48,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:24:48,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:24:48,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:24:48,438 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:24:48,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:23:21" (3/4) ... [2019-12-07 15:24:48,440 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:24:48,478 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ef74363d-7610-4120-a8e4-b0aec7462cb7/bin/uautomizer/witness.graphml [2019-12-07 15:24:48,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:24:48,479 INFO L168 Benchmark]: Toolchain (without parser) took 87257.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 934.0 MB in the beginning and 965.7 MB in the end (delta: -31.7 MB). Peak memory consumption was 234.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:24:48,479 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:24:48,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:24:48,479 INFO L168 Benchmark]: Boogie Preprocessor took 41.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:24:48,480 INFO L168 Benchmark]: RCFGBuilder took 384.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:24:48,480 INFO L168 Benchmark]: TraceAbstraction took 86458.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 977.0 MB in the end (delta: 73.3 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:24:48,480 INFO L168 Benchmark]: Witness Printer took 40.01 ms. Allocated memory is still 1.3 GB. Free memory was 977.0 MB in the beginning and 965.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:24:48,481 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 384.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86458.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 977.0 MB in the end (delta: 73.3 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. * Witness Printer took 40.01 ms. Allocated memory is still 1.3 GB. Free memory was 977.0 MB in the beginning and 965.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 599]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L556] List p, a, t; [L557] a = (List) malloc(sizeof(struct node)) VAL [a={7:0}, malloc(sizeof(struct node))={7:0}] [L558] COND FALSE !(a == 0) VAL [a={7:0}, malloc(sizeof(struct node))={7:0}] [L559] a->n = 0 VAL [a={7:0}, malloc(sizeof(struct node))={7:0}] [L560] p = a [L561] int i = 0; VAL [a={7:0}, i=0, malloc(sizeof(struct node))={7:0}, p={7:0}] [L562] i < 20 && __VERIFIER_nondet_int() [L562] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={7:0}, i=0, i < 20 && __VERIFIER_nondet_int()=1, malloc(sizeof(struct node))={7:0}, p={7:0}] [L562] COND TRUE i < 20 && __VERIFIER_nondet_int() [L563] i++ [L564] p->flag = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, p={7:0}] [L565] p->flag VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, p={7:0}, p->flag=0] [L565] COND FALSE !(p->flag) [L568] p->h = 2 VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, p={7:0}] [L570] t = (List) malloc(sizeof(struct node)) VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L571] COND FALSE !(t == 0) VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L572] p->n = t VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L573] EXPR p->n VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->n={-1:0}, t={-1:0}] [L573] p = p->n [L562] i < 20 && __VERIFIER_nondet_int() [L562] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={7:0}, i=1, i < 20 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] [L562] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L575] p->h = 3 VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] [L576] p = a VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L577] EXPR p->h VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->h=2, t={-1:0}] [L577] COND TRUE p->h != 3 [L578] p->flag VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->flag=0, t={-1:0}] [L578] COND FALSE !(p->flag) [L582] EXPR p->h VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->h=2, t={-1:0}] [L582] COND FALSE !(p->h != 2) [L585] EXPR p->n VAL [a={7:0}, i=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->n={-1:0}, t={-1:0}] [L585] p = p->n [L586] i++ VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] [L577] EXPR p->h VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3, t={-1:0}] [L577] COND FALSE !(p->h != 3) [L588] EXPR p->h VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3, t={-1:0}] [L588] COND FALSE !(p->h != 3 || i > 20) [L590] p = a VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L591] COND FALSE !(p == 0) VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L594] EXPR p->n VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->n={-1:0}, t={-1:0}] [L594] COND FALSE !(p->n == 0) [L599] EXPR p->n VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->n={-1:0}, t={-1:0}] [L599] COND TRUE p->n != 0 [L600] EXPR p->n VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, p->n={-1:0}, t={-1:0}] [L600] t = p->n [L601] free(p) VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L601] free(p) VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={7:0}, t={-1:0}] [L601] free(p) [L602] p = t VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] [L599] EXPR p->n VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={14:21}, t={-1:0}] [L599] COND TRUE p->n != 0 [L600] EXPR p->n VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={14:21}, t={-1:0}] [L600] t = p->n [L601] free(p) VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={14:21}] [L601] free(p) VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={14:21}] [L601] free(p) [L602] p = t VAL [a={7:0}, i=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, p={14:21}, t={14:21}] [L599] p->n - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 116 locations, 45 error locations. Result: UNSAFE, OverallTime: 86.3s, OverallIterations: 40, TraceHistogramMax: 3, AutomataDifference: 56.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2634 SDtfs, 18345 SDslu, 22619 SDs, 0 SdLazy, 36885 SolverSat, 3133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2229 GetRequests, 933 SyntacticMatches, 57 SemanticMatches, 1239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15193 ImplicationChecksByTransitivity, 35.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 3121 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 2714 NumberOfCodeBlocks, 2714 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 2592 ConstructedInterpolants, 268 QuantifiedInterpolants, 2293784 SizeOfPredicates, 447 NumberOfNonLiveVariables, 5680 ConjunctsInSsa, 1097 ConjunctsInUnsatCore, 65 InterpolantComputations, 13 PerfectInterpolantSequences, 39/609 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...