./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.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_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 082b1bde50b1883aaa9112842176e8bb0db36577 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:15:31,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:15:31,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:15:31,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:15:31,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:15:31,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:15:31,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:15:31,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:15:31,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:15:31,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:15:31,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:15:31,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:15:31,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:15:31,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:15:31,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:15:31,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:15:31,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:15:31,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:15:31,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:15:31,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:15:31,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:15:31,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:15:31,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:15:31,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:15:31,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:15:31,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:15:31,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:15:31,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:15:31,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:15:31,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:15:31,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:15:31,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:15:31,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:15:31,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:15:31,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:15:31,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:15:31,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:15:31,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:15:31,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:15:31,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:15:31,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:15:31,237 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:15:31,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:15:31,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:15:31,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:15:31,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:15:31,248 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:15:31,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:15:31,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:15:31,248 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:15:31,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:15:31,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:15:31,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:15:31,248 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:15:31,249 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:15:31,249 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:15:31,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:15:31,249 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:15:31,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:15:31,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:15:31,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:15:31,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:15:31,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:15:31,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:15:31,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:15:31,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:15:31,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:15:31,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:15:31,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:15:31,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:15:31,251 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_00123030-2d3e-4726-badd-82f0f199a6f3/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 -> 082b1bde50b1883aaa9112842176e8bb0db36577 [2019-12-07 18:15:31,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:15:31,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:15:31,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:15:31,360 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:15:31,360 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:15:31,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-12-07 18:15:31,397 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/data/22114ae59/02941164d4154a1daba8b3761e1866d1/FLAG0d60a021a [2019-12-07 18:15:31,771 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:15:31,772 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-12-07 18:15:31,782 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/data/22114ae59/02941164d4154a1daba8b3761e1866d1/FLAG0d60a021a [2019-12-07 18:15:32,165 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/data/22114ae59/02941164d4154a1daba8b3761e1866d1 [2019-12-07 18:15:32,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:15:32,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:15:32,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:15:32,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:15:32,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:15:32,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c192a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32, skipping insertion in model container [2019-12-07 18:15:32,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:15:32,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:15:32,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:15:32,414 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:15:32,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:15:32,477 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:15:32,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32 WrapperNode [2019-12-07 18:15:32,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:15:32,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:15:32,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:15:32,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:15:32,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... [2019-12-07 18:15:32,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:15:32,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:15:32,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:15:32,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:15:32,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:32,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_first [2019-12-07 18:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:15:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:15:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:15:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:15:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:15:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:15:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:15:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:15:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_first [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:15:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:15:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:15:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:15:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 18:15:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:15:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:15:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:15:32,734 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 18:15:32,906 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:15:32,907 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 18:15:32,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:15:32 BoogieIcfgContainer [2019-12-07 18:15:32,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:15:32,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:15:32,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:15:32,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:15:32,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:15:32" (1/3) ... [2019-12-07 18:15:32,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464b9ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:15:32, skipping insertion in model container [2019-12-07 18:15:32,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:32" (2/3) ... [2019-12-07 18:15:32,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464b9ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:15:32, skipping insertion in model container [2019-12-07 18:15:32,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:15:32" (3/3) ... [2019-12-07 18:15:32,913 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2019-12-07 18:15:32,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:15:32,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. [2019-12-07 18:15:32,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2019-12-07 18:15:32,947 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:15:32,947 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:15:32,947 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:15:32,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:15:32,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:15:32,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:15:32,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:15:32,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:15:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-12-07 18:15:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 18:15:32,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:32,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:32,969 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1392846868, now seen corresponding path program 1 times [2019-12-07 18:15:32,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:32,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17669751] [2019-12-07 18:15:32,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:33,123 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 18:15:33,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17669751] [2019-12-07 18:15:33,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:33,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:15:33,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702976233] [2019-12-07 18:15:33,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:15:33,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:15:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:15:33,138 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2019-12-07 18:15:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:33,324 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2019-12-07 18:15:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:15:33,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 18:15:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:33,332 INFO L225 Difference]: With dead ends: 106 [2019-12-07 18:15:33,332 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 18:15:33,333 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 18:15:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 18:15:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 18:15:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 18:15:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-12-07 18:15:33,363 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 12 [2019-12-07 18:15:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:33,363 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-12-07 18:15:33,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:15:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-12-07 18:15:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 18:15:33,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:33,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:33,364 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:33,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1392846869, now seen corresponding path program 1 times [2019-12-07 18:15:33,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:33,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941136314] [2019-12-07 18:15:33,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:33,421 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 18:15:33,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941136314] [2019-12-07 18:15:33,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:33,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:15:33,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606490272] [2019-12-07 18:15:33,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:15:33,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:33,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:15:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:15:33,423 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 4 states. [2019-12-07 18:15:33,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:33,544 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-12-07 18:15:33,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:15:33,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 18:15:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:33,546 INFO L225 Difference]: With dead ends: 98 [2019-12-07 18:15:33,546 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 18:15:33,547 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 18:15:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 18:15:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-07 18:15:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:15:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-12-07 18:15:33,555 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 12 [2019-12-07 18:15:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:33,556 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-12-07 18:15:33,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:15:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-12-07 18:15:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:15:33,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:33,557 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 18:15:33,557 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:33,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash -275047516, now seen corresponding path program 1 times [2019-12-07 18:15:33,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:33,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746230269] [2019-12-07 18:15:33,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:33,657 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 18:15:33,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746230269] [2019-12-07 18:15:33,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:33,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:15:33,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096496122] [2019-12-07 18:15:33,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:15:33,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:15:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:15:33,659 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 8 states. [2019-12-07 18:15:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:33,956 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2019-12-07 18:15:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:15:33,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 18:15:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:33,959 INFO L225 Difference]: With dead ends: 102 [2019-12-07 18:15:33,959 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 18:15:33,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:15:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 18:15:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-12-07 18:15:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 18:15:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-12-07 18:15:33,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 19 [2019-12-07 18:15:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:33,967 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-12-07 18:15:33,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:15:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-12-07 18:15:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:15:33,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:33,968 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 18:15:33,969 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash -275047515, now seen corresponding path program 1 times [2019-12-07 18:15:33,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:33,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255438861] [2019-12-07 18:15:33,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,044 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 18:15:34,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255438861] [2019-12-07 18:15:34,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:34,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:15:34,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695466446] [2019-12-07 18:15:34,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:15:34,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:15:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:15:34,046 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 7 states. [2019-12-07 18:15:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:34,262 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-12-07 18:15:34,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:15:34,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 18:15:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:34,264 INFO L225 Difference]: With dead ends: 99 [2019-12-07 18:15:34,264 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 18:15:34,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:15:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 18:15:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 18:15:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 18:15:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-12-07 18:15:34,269 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 19 [2019-12-07 18:15:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:34,269 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-12-07 18:15:34,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:15:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-12-07 18:15:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:15:34,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:34,270 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:34,270 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:34,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1961658597, now seen corresponding path program 1 times [2019-12-07 18:15:34,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:34,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79604364] [2019-12-07 18:15:34,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:15:34,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79604364] [2019-12-07 18:15:34,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:34,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:15:34,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951455597] [2019-12-07 18:15:34,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:15:34,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:15:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:15:34,349 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 8 states. [2019-12-07 18:15:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:34,595 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-12-07 18:15:34,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:15:34,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 18:15:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:34,596 INFO L225 Difference]: With dead ends: 99 [2019-12-07 18:15:34,596 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 18:15:34,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:15:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 18:15:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-12-07 18:15:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:15:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-12-07 18:15:34,603 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 28 [2019-12-07 18:15:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:34,603 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-12-07 18:15:34,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:15:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-12-07 18:15:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:15:34,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:34,604 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:34,605 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1961658598, now seen corresponding path program 1 times [2019-12-07 18:15:34,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:34,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228007574] [2019-12-07 18:15:34,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:34,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228007574] [2019-12-07 18:15:34,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:34,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:15:34,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831179730] [2019-12-07 18:15:34,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:15:34,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:34,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:15:34,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:15:34,702 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 8 states. [2019-12-07 18:15:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:34,947 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-12-07 18:15:34,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:15:34,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 18:15:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:34,948 INFO L225 Difference]: With dead ends: 98 [2019-12-07 18:15:34,948 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 18:15:34,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:15:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 18:15:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-12-07 18:15:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 18:15:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-12-07 18:15:34,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 28 [2019-12-07 18:15:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:34,953 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-12-07 18:15:34,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:15:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-12-07 18:15:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 18:15:34,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:34,954 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:34,955 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1848690990, now seen corresponding path program 1 times [2019-12-07 18:15:34,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:34,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130098822] [2019-12-07 18:15:34,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:35,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130098822] [2019-12-07 18:15:35,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686881121] [2019-12-07 18:15:35,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:35,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:15:35,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:35,237 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:15:35,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:35,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-12-07 18:15:35,247 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:35,257 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:15:35,257 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 18:15:35,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 18:15:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:35,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:35,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-12-07 18:15:35,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311303488] [2019-12-07 18:15:35,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:15:35,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:15:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:15:35,266 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 12 states. [2019-12-07 18:15:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:35,717 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 18:15:35,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:15:35,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-12-07 18:15:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:35,718 INFO L225 Difference]: With dead ends: 97 [2019-12-07 18:15:35,718 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 18:15:35,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:15:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 18:15:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-12-07 18:15:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 18:15:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-12-07 18:15:35,724 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 31 [2019-12-07 18:15:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:35,725 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-12-07 18:15:35,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:15:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-12-07 18:15:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 18:15:35,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:35,726 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:35,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:35,928 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1848690989, now seen corresponding path program 1 times [2019-12-07 18:15:35,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:35,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664329051] [2019-12-07 18:15:35,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:36,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664329051] [2019-12-07 18:15:36,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373603483] [2019-12-07 18:15:36,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:36,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 18:15:36,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:36,125 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 18:15:36,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:36,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:36,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:15:36,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:15:36,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:36,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-12-07 18:15:36,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:36,253 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 18:15:36,253 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 18:15:36,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-12-07 18:15:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:36,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:36,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-07 18:15:36,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805691533] [2019-12-07 18:15:36,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:15:36,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:36,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:15:36,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:15:36,271 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 16 states. [2019-12-07 18:15:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:36,801 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 18:15:36,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:15:36,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-12-07 18:15:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:36,802 INFO L225 Difference]: With dead ends: 97 [2019-12-07 18:15:36,802 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 18:15:36,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:15:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 18:15:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-12-07 18:15:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 18:15:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-12-07 18:15:36,807 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 31 [2019-12-07 18:15:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:36,807 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-12-07 18:15:36,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:15:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-12-07 18:15:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:15:36,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:36,808 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:37,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:37,010 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:37,011 INFO L82 PathProgramCache]: Analyzing trace with hash 138864695, now seen corresponding path program 1 times [2019-12-07 18:15:37,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:37,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073305043] [2019-12-07 18:15:37,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:15:37,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073305043] [2019-12-07 18:15:37,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:37,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:15:37,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234029152] [2019-12-07 18:15:37,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:15:37,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:15:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:15:37,217 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 6 states. [2019-12-07 18:15:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:37,380 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-12-07 18:15:37,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:15:37,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 18:15:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:37,381 INFO L225 Difference]: With dead ends: 98 [2019-12-07 18:15:37,381 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 18:15:37,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:15:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 18:15:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-12-07 18:15:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 18:15:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-12-07 18:15:37,385 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 37 [2019-12-07 18:15:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:37,385 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-12-07 18:15:37,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:15:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-12-07 18:15:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:15:37,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:37,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:37,386 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash 305160364, now seen corresponding path program 1 times [2019-12-07 18:15:37,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:37,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411226975] [2019-12-07 18:15:37,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:15:37,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411226975] [2019-12-07 18:15:37,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127124760] [2019-12-07 18:15:37,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:37,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 18:15:37,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:37,785 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 18:15:37,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:37,787 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:37,787 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:15:37,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:15:37,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:15:37,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:15:37,934 INFO L343 Elim1Store]: treesize reduction 3, result has 91.7 percent of original size [2019-12-07 18:15:37,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 36 [2019-12-07 18:15:37,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:37,949 INFO L614 ElimStorePlain]: treesize reduction 27, result has 37.2 percent of original size [2019-12-07 18:15:37,950 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 18:15:37,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-12-07 18:15:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:15:37,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:37,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2019-12-07 18:15:37,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389415785] [2019-12-07 18:15:37,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:15:37,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:37,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:15:37,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:15:37,958 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 19 states. [2019-12-07 18:15:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:38,860 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2019-12-07 18:15:38,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:15:38,860 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2019-12-07 18:15:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:38,861 INFO L225 Difference]: With dead ends: 147 [2019-12-07 18:15:38,861 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 18:15:38,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:15:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 18:15:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2019-12-07 18:15:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 18:15:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-12-07 18:15:38,867 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 39 [2019-12-07 18:15:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:38,867 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-12-07 18:15:38,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:15:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-12-07 18:15:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:15:38,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:38,868 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:39,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:39,070 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash 305160365, now seen corresponding path program 1 times [2019-12-07 18:15:39,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:39,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061456861] [2019-12-07 18:15:39,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:15:39,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061456861] [2019-12-07 18:15:39,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325966146] [2019-12-07 18:15:39,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:39,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 18:15:39,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:39,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 18:15:39,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:39,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:39,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:15:39,459 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 18:15:39,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 18:15:39,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:39,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:39,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:15:39,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 18:15:39,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:15:39,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:15:39,546 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 18:15:39,546 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 18:15:39,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:39,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:39,554 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 18:15:39,554 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-12-07 18:15:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:15:39,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:39,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-12-07 18:15:39,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115576313] [2019-12-07 18:15:39,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:15:39,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:39,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:15:39,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:15:39,616 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 18 states. [2019-12-07 18:15:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:40,564 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2019-12-07 18:15:40,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:15:40,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-12-07 18:15:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:40,565 INFO L225 Difference]: With dead ends: 158 [2019-12-07 18:15:40,565 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 18:15:40,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:15:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 18:15:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 135. [2019-12-07 18:15:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 18:15:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2019-12-07 18:15:40,570 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 39 [2019-12-07 18:15:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:40,570 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2019-12-07 18:15:40,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:15:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2019-12-07 18:15:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:15:40,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:40,571 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:40,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:40,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash 870036748, now seen corresponding path program 1 times [2019-12-07 18:15:40,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:40,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934011862] [2019-12-07 18:15:40,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:15:40,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934011862] [2019-12-07 18:15:40,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:40,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:15:40,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303934332] [2019-12-07 18:15:40,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:15:40,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:40,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:15:40,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:40,914 INFO L87 Difference]: Start difference. First operand 135 states and 163 transitions. Second operand 15 states. [2019-12-07 18:15:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:41,508 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2019-12-07 18:15:41,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:15:41,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-12-07 18:15:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:41,509 INFO L225 Difference]: With dead ends: 186 [2019-12-07 18:15:41,509 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 18:15:41,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:15:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 18:15:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 140. [2019-12-07 18:15:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 18:15:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2019-12-07 18:15:41,515 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 40 [2019-12-07 18:15:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:41,516 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2019-12-07 18:15:41,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:15:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2019-12-07 18:15:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:15:41,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:41,517 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:41,517 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash 870036749, now seen corresponding path program 1 times [2019-12-07 18:15:41,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:41,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259765275] [2019-12-07 18:15:41,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:41,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259765275] [2019-12-07 18:15:41,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:41,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:15:41,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971743315] [2019-12-07 18:15:41,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:15:41,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:15:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:41,686 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand 15 states. [2019-12-07 18:15:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:42,296 INFO L93 Difference]: Finished difference Result 189 states and 232 transitions. [2019-12-07 18:15:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:15:42,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-12-07 18:15:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:42,298 INFO L225 Difference]: With dead ends: 189 [2019-12-07 18:15:42,298 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 18:15:42,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:15:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 18:15:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 140. [2019-12-07 18:15:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 18:15:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2019-12-07 18:15:42,303 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 40 [2019-12-07 18:15:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:42,304 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2019-12-07 18:15:42,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:15:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2019-12-07 18:15:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:15:42,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:42,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:42,305 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash -234668106, now seen corresponding path program 1 times [2019-12-07 18:15:42,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:42,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397113265] [2019-12-07 18:15:42,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:42,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397113265] [2019-12-07 18:15:42,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:42,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:15:42,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608655427] [2019-12-07 18:15:42,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:15:42,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:15:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:42,437 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand 15 states. [2019-12-07 18:15:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:42,987 INFO L93 Difference]: Finished difference Result 217 states and 271 transitions. [2019-12-07 18:15:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:15:42,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-12-07 18:15:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:42,989 INFO L225 Difference]: With dead ends: 217 [2019-12-07 18:15:42,989 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 18:15:42,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:15:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 18:15:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 176. [2019-12-07 18:15:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 18:15:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2019-12-07 18:15:42,996 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 45 [2019-12-07 18:15:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:42,997 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2019-12-07 18:15:42,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:15:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2019-12-07 18:15:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:15:42,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:42,997 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:42,998 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1315654387, now seen corresponding path program 1 times [2019-12-07 18:15:42,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:42,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551529526] [2019-12-07 18:15:42,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:15:43,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551529526] [2019-12-07 18:15:43,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:43,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:15:43,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610959714] [2019-12-07 18:15:43,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:15:43,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:43,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:15:43,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:15:43,053 INFO L87 Difference]: Start difference. First operand 176 states and 231 transitions. Second operand 8 states. [2019-12-07 18:15:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:43,306 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2019-12-07 18:15:43,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:15:43,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-12-07 18:15:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:43,308 INFO L225 Difference]: With dead ends: 177 [2019-12-07 18:15:43,308 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 18:15:43,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 18:15:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-12-07 18:15:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 18:15:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2019-12-07 18:15:43,313 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 46 [2019-12-07 18:15:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:43,313 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2019-12-07 18:15:43,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:15:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2019-12-07 18:15:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:15:43,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:43,314 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:43,314 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1315654388, now seen corresponding path program 1 times [2019-12-07 18:15:43,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:43,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869338539] [2019-12-07 18:15:43,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:43,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869338539] [2019-12-07 18:15:43,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:43,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 18:15:43,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087704891] [2019-12-07 18:15:43,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:15:43,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:15:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:15:43,506 INFO L87 Difference]: Start difference. First operand 176 states and 231 transitions. Second operand 17 states. [2019-12-07 18:15:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:45,114 INFO L93 Difference]: Finished difference Result 255 states and 325 transitions. [2019-12-07 18:15:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:15:45,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-12-07 18:15:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:45,116 INFO L225 Difference]: With dead ends: 255 [2019-12-07 18:15:45,116 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 18:15:45,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:15:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 18:15:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 210. [2019-12-07 18:15:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 18:15:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 282 transitions. [2019-12-07 18:15:45,122 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 282 transitions. Word has length 46 [2019-12-07 18:15:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:45,122 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 282 transitions. [2019-12-07 18:15:45,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:15:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 282 transitions. [2019-12-07 18:15:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:15:45,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:45,123 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:45,123 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:45,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1315223438, now seen corresponding path program 1 times [2019-12-07 18:15:45,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:45,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204570338] [2019-12-07 18:15:45,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:45,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204570338] [2019-12-07 18:15:45,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:45,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:15:45,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800980410] [2019-12-07 18:15:45,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:15:45,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:15:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:45,274 INFO L87 Difference]: Start difference. First operand 210 states and 282 transitions. Second operand 15 states. [2019-12-07 18:15:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:47,051 INFO L93 Difference]: Finished difference Result 245 states and 321 transitions. [2019-12-07 18:15:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:15:47,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-12-07 18:15:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:47,057 INFO L225 Difference]: With dead ends: 245 [2019-12-07 18:15:47,057 INFO L226 Difference]: Without dead ends: 245 [2019-12-07 18:15:47,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:15:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-07 18:15:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 216. [2019-12-07 18:15:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 18:15:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 289 transitions. [2019-12-07 18:15:47,076 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 289 transitions. Word has length 46 [2019-12-07 18:15:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:47,076 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 289 transitions. [2019-12-07 18:15:47,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:15:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 289 transitions. [2019-12-07 18:15:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:15:47,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:47,078 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:47,078 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2117221048, now seen corresponding path program 1 times [2019-12-07 18:15:47,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:47,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138396732] [2019-12-07 18:15:47,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:15:47,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138396732] [2019-12-07 18:15:47,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:47,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:15:47,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268759398] [2019-12-07 18:15:47,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:15:47,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:15:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:15:47,135 INFO L87 Difference]: Start difference. First operand 216 states and 289 transitions. Second operand 7 states. [2019-12-07 18:15:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:47,341 INFO L93 Difference]: Finished difference Result 215 states and 285 transitions. [2019-12-07 18:15:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:15:47,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 18:15:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:47,343 INFO L225 Difference]: With dead ends: 215 [2019-12-07 18:15:47,343 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 18:15:47,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:15:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 18:15:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-12-07 18:15:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-07 18:15:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 285 transitions. [2019-12-07 18:15:47,349 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 285 transitions. Word has length 47 [2019-12-07 18:15:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:47,349 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 285 transitions. [2019-12-07 18:15:47,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:15:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 285 transitions. [2019-12-07 18:15:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:15:47,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:47,350 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:47,350 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1209343185, now seen corresponding path program 1 times [2019-12-07 18:15:47,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:47,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873874656] [2019-12-07 18:15:47,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:47,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873874656] [2019-12-07 18:15:47,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:47,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 18:15:47,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158461453] [2019-12-07 18:15:47,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:15:47,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:15:47,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:15:47,506 INFO L87 Difference]: Start difference. First operand 215 states and 285 transitions. Second operand 18 states. [2019-12-07 18:15:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:49,040 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2019-12-07 18:15:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:15:49,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-12-07 18:15:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:49,044 INFO L225 Difference]: With dead ends: 242 [2019-12-07 18:15:49,044 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:15:49,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:15:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:15:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 219. [2019-12-07 18:15:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 18:15:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2019-12-07 18:15:49,057 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 48 [2019-12-07 18:15:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:49,058 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2019-12-07 18:15:49,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:15:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2019-12-07 18:15:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:15:49,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:49,059 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:49,060 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash -138077990, now seen corresponding path program 2 times [2019-12-07 18:15:49,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:49,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153882424] [2019-12-07 18:15:49,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 18:15:49,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153882424] [2019-12-07 18:15:49,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146349391] [2019-12-07 18:15:49,142 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:49,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:15:49,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:49,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:15:49,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 18:15:49,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:49,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 18:15:49,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545839311] [2019-12-07 18:15:49,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:15:49,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:15:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:15:49,247 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand 9 states. [2019-12-07 18:15:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:49,498 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2019-12-07 18:15:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:15:49,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-07 18:15:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:49,499 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:15:49,500 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 18:15:49,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:15:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 18:15:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-12-07 18:15:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 18:15:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2019-12-07 18:15:49,504 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 51 [2019-12-07 18:15:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:49,504 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2019-12-07 18:15:49,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:15:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2019-12-07 18:15:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:15:49,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:49,505 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:49,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:49,706 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash -420676485, now seen corresponding path program 1 times [2019-12-07 18:15:49,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:49,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875378669] [2019-12-07 18:15:49,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:50,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875378669] [2019-12-07 18:15:50,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49117820] [2019-12-07 18:15:50,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:50,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-07 18:15:50,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:50,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,169 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 18:15:50,170 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:50,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:15:50,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:15:50,175 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 11 treesize of output 7 [2019-12-07 18:15:50,175 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:50,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:15:50,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 18:15:50,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,215 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 37 treesize of output 51 [2019-12-07 18:15:50,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:50,217 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:50,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,222 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 18:15:50,222 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 18:15:50,487 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 68 treesize of output 52 [2019-12-07 18:15:50,488 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:50,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,495 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 18:15:50,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:56 [2019-12-07 18:15:50,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,649 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 58 [2019-12-07 18:15:50,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:15:50,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:50,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:50,651 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 18:15:50,652 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:5 [2019-12-07 18:15:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:50,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:50,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 35 [2019-12-07 18:15:50,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503931196] [2019-12-07 18:15:50,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 18:15:50,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:15:50,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:15:50,661 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand 36 states. [2019-12-07 18:15:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:52,842 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2019-12-07 18:15:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:15:52,843 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-12-07 18:15:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:52,843 INFO L225 Difference]: With dead ends: 137 [2019-12-07 18:15:52,843 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 18:15:52,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=259, Invalid=2603, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:15:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 18:15:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2019-12-07 18:15:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 18:15:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-12-07 18:15:52,847 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 51 [2019-12-07 18:15:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:52,848 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-12-07 18:15:52,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 18:15:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-12-07 18:15:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:15:52,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:52,848 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:53,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:53,049 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:15:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash -420676484, now seen corresponding path program 1 times [2019-12-07 18:15:53,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:53,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990212646] [2019-12-07 18:15:53,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:53,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990212646] [2019-12-07 18:15:53,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969625491] [2019-12-07 18:15:53,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:15:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:53,654 INFO L264 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 104 conjunts are in the unsatisfiable core [2019-12-07 18:15:53,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:54,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:54,008 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 18:15:54,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:54,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:54,020 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 14 treesize of output 16 [2019-12-07 18:15:54,020 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:54,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:54,032 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:15:54,032 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2019-12-07 18:15:54,135 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 11 treesize of output 7 [2019-12-07 18:15:54,135 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:54,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:54,149 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 11 treesize of output 7 [2019-12-07 18:15:54,150 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:54,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:54,163 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 18:15:54,163 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2019-12-07 18:15:54,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:54,298 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 62 treesize of output 68 [2019-12-07 18:15:54,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:15:54,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:54,299 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:15:54,332 INFO L614 ElimStorePlain]: treesize reduction 60, result has 56.8 percent of original size [2019-12-07 18:15:54,335 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 49 treesize of output 36 [2019-12-07 18:15:54,336 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:54,348 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:54,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:15:54,348 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:71 [2019-12-07 18:15:55,215 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:15:55,225 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:55,226 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 117 [2019-12-07 18:15:55,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:55,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:55,227 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 18:15:55,256 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.6 percent of original size [2019-12-07 18:15:55,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:55,263 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 41 [2019-12-07 18:15:55,263 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:15:55,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:15:55,271 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 18:15:55,271 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:181, output treesize:23 [2019-12-07 18:15:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:55,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:55,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 51 [2019-12-07 18:15:55,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715319880] [2019-12-07 18:15:55,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 18:15:55,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 18:15:55,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2524, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:15:55,417 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 52 states. [2019-12-07 18:15:57,103 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-12-07 18:15:57,367 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-12-07 18:15:58,311 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-12-07 18:15:58,574 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2019-12-07 18:15:59,226 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 18:15:59,571 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 94 [2019-12-07 18:16:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:00,478 INFO L93 Difference]: Finished difference Result 152 states and 174 transitions. [2019-12-07 18:16:00,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:16:00,480 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-12-07 18:16:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:00,482 INFO L225 Difference]: With dead ends: 152 [2019-12-07 18:16:00,482 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 18:16:00,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=357, Invalid=5193, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 18:16:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 18:16:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2019-12-07 18:16:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 18:16:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-12-07 18:16:00,495 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 51 [2019-12-07 18:16:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:00,496 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-12-07 18:16:00,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 18:16:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-12-07 18:16:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:16:00,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:00,497 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:00,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:00,699 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash -420729100, now seen corresponding path program 1 times [2019-12-07 18:16:00,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:00,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546146959] [2019-12-07 18:16:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:16:00,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546146959] [2019-12-07 18:16:00,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:00,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 18:16:00,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384050355] [2019-12-07 18:16:00,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:16:00,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:16:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:16:00,877 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 13 states. [2019-12-07 18:16:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:01,450 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2019-12-07 18:16:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:16:01,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-12-07 18:16:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:01,451 INFO L225 Difference]: With dead ends: 135 [2019-12-07 18:16:01,451 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 18:16:01,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:16:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 18:16:01,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2019-12-07 18:16:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 18:16:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2019-12-07 18:16:01,454 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 51 [2019-12-07 18:16:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:01,454 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2019-12-07 18:16:01,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:16:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2019-12-07 18:16:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:16:01,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:01,454 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:01,455 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1336664970, now seen corresponding path program 1 times [2019-12-07 18:16:01,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:01,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499012546] [2019-12-07 18:16:01,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:16:01,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499012546] [2019-12-07 18:16:01,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:01,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:16:01,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661071831] [2019-12-07 18:16:01,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:01,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:01,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:01,513 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 8 states. [2019-12-07 18:16:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:01,694 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2019-12-07 18:16:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:16:01,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-07 18:16:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:01,695 INFO L225 Difference]: With dead ends: 129 [2019-12-07 18:16:01,696 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 18:16:01,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 18:16:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-12-07 18:16:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 18:16:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-12-07 18:16:01,699 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 53 [2019-12-07 18:16:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:01,699 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-12-07 18:16:01,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-12-07 18:16:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 18:16:01,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:01,700 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:01,700 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash -339814055, now seen corresponding path program 1 times [2019-12-07 18:16:01,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:01,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141191975] [2019-12-07 18:16:01,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:16:01,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141191975] [2019-12-07 18:16:01,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67925781] [2019-12-07 18:16:01,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:01,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:16:01,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:16:01,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:01,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-12-07 18:16:01,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465006703] [2019-12-07 18:16:01,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:01,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:01,860 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 10 states. [2019-12-07 18:16:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:02,020 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2019-12-07 18:16:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:02,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 18:16:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:02,021 INFO L225 Difference]: With dead ends: 137 [2019-12-07 18:16:02,021 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 18:16:02,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 18:16:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-12-07 18:16:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 18:16:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2019-12-07 18:16:02,025 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 55 [2019-12-07 18:16:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:02,025 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2019-12-07 18:16:02,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2019-12-07 18:16:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:16:02,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:02,026 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] [2019-12-07 18:16:02,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:02,227 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1938906003, now seen corresponding path program 1 times [2019-12-07 18:16:02,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:02,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138058828] [2019-12-07 18:16:02,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:16:03,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138058828] [2019-12-07 18:16:03,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474442655] [2019-12-07 18:16:03,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:03,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 73 conjunts are in the unsatisfiable core [2019-12-07 18:16:03,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:03,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:03,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 18:16:03,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:03,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:03,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:03,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 18:16:03,636 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 11 treesize of output 7 [2019-12-07 18:16:03,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:03,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:03,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:03,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 18:16:03,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:03,890 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 28 treesize of output 46 [2019-12-07 18:16:03,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:03,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:03,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:16:03,928 INFO L614 ElimStorePlain]: treesize reduction 25, result has 44.4 percent of original size [2019-12-07 18:16:03,929 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 18:16:03,929 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-12-07 18:16:04,960 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 27 treesize of output 19 [2019-12-07 18:16:04,961 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:04,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:04,965 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:04,965 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:15 [2019-12-07 18:16:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:05,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:05,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28] total 59 [2019-12-07 18:16:05,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826316850] [2019-12-07 18:16:05,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-12-07 18:16:05,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-12-07 18:16:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3236, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 18:16:05,330 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 59 states. [2019-12-07 18:16:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:09,152 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-12-07 18:16:09,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:16:09,152 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 56 [2019-12-07 18:16:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:09,153 INFO L225 Difference]: With dead ends: 117 [2019-12-07 18:16:09,153 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 18:16:09,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=563, Invalid=7269, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 18:16:09,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 18:16:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-12-07 18:16:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 18:16:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-12-07 18:16:09,157 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 56 [2019-12-07 18:16:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:09,157 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-12-07 18:16:09,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-12-07 18:16:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-12-07 18:16:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:16:09,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:09,158 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:09,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:09,358 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1759838195, now seen corresponding path program 2 times [2019-12-07 18:16:09,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:09,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516754392] [2019-12-07 18:16:09,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:16:09,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516754392] [2019-12-07 18:16:09,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143525887] [2019-12-07 18:16:09,790 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:09,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:16:09,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:16:09,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 114 conjunts are in the unsatisfiable core [2019-12-07 18:16:09,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:10,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:10,167 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 18:16:10,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,189 INFO L614 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-12-07 18:16:10,189 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-12-07 18:16:10,285 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 11 treesize of output 7 [2019-12-07 18:16:10,285 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:10,300 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 11 treesize of output 7 [2019-12-07 18:16:10,301 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:10,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,313 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-12-07 18:16:10,428 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 61 treesize of output 47 [2019-12-07 18:16:10,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:10,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:10,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:10,450 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 56 treesize of output 58 [2019-12-07 18:16:10,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:10,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:10,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:10,462 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2019-12-07 18:16:11,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:11,309 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 139 [2019-12-07 18:16:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:11,312 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 18:16:11,340 INFO L614 ElimStorePlain]: treesize reduction 16, result has 83.5 percent of original size [2019-12-07 18:16:11,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:16:11,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:191, output treesize:81 [2019-12-07 18:16:11,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:11,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:11,518 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:11,519 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 51 [2019-12-07 18:16:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:11,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:11,520 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 18:16:11,538 INFO L614 ElimStorePlain]: treesize reduction 4, result has 88.6 percent of original size [2019-12-07 18:16:11,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:16:11,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:15 [2019-12-07 18:16:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:11,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:11,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 56 [2019-12-07 18:16:11,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220900293] [2019-12-07 18:16:11,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 18:16:11,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 18:16:11,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3008, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 18:16:11,667 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 57 states. [2019-12-07 18:16:13,631 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-12-07 18:16:13,853 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-12-07 18:16:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:14,463 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2019-12-07 18:16:14,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 18:16:14,463 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-12-07 18:16:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:14,464 INFO L225 Difference]: With dead ends: 130 [2019-12-07 18:16:14,464 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 18:16:14,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=435, Invalid=5265, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 18:16:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 18:16:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2019-12-07 18:16:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 18:16:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2019-12-07 18:16:14,469 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 56 [2019-12-07 18:16:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:14,469 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2019-12-07 18:16:14,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 18:16:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2019-12-07 18:16:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:16:14,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:14,470 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:14,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:14,671 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1759838196, now seen corresponding path program 2 times [2019-12-07 18:16:14,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:14,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730954425] [2019-12-07 18:16:14,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:16:15,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730954425] [2019-12-07 18:16:15,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783954237] [2019-12-07 18:16:15,127 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:15,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:16:15,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:16:15,211 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 115 conjunts are in the unsatisfiable core [2019-12-07 18:16:15,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:15,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:15,507 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 18:16:15,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:15,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-12-07 18:16:15,595 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 11 treesize of output 7 [2019-12-07 18:16:15,595 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,604 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:15,606 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 11 treesize of output 7 [2019-12-07 18:16:15,606 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:15,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,614 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2019-12-07 18:16:15,718 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:15,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:15,726 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 57 [2019-12-07 18:16:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:15,727 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:15,739 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 53 treesize of output 39 [2019-12-07 18:16:15,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:15,750 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:15,750 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2019-12-07 18:16:17,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:17,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:17,072 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 123 [2019-12-07 18:16:17,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:17,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:17,073 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 18:16:17,101 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2019-12-07 18:16:17,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:17,107 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 40 [2019-12-07 18:16:17,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:17,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:17,122 INFO L614 ElimStorePlain]: treesize reduction 8, result has 72.4 percent of original size [2019-12-07 18:16:17,122 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 18:16:17,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:211, output treesize:13 [2019-12-07 18:16:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:17,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:17,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 55 [2019-12-07 18:16:17,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565582170] [2019-12-07 18:16:17,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 18:16:17,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 18:16:17,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2810, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 18:16:17,183 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 55 states. [2019-12-07 18:16:18,634 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 18:16:19,586 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 18:16:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:21,071 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2019-12-07 18:16:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:16:21,072 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-12-07 18:16:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:21,074 INFO L225 Difference]: With dead ends: 109 [2019-12-07 18:16:21,074 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 18:16:21,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=365, Invalid=4747, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 18:16:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 18:16:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-12-07 18:16:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 18:16:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-12-07 18:16:21,082 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 56 [2019-12-07 18:16:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:21,082 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-12-07 18:16:21,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 18:16:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-12-07 18:16:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:16:21,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:21,084 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:21,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:21,285 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1759785580, now seen corresponding path program 1 times [2019-12-07 18:16:21,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:21,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988085133] [2019-12-07 18:16:21,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:16:21,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988085133] [2019-12-07 18:16:21,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71440092] [2019-12-07 18:16:21,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:21,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-07 18:16:21,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:22,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 18:16:22,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:16:22,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,110 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 18:16:22,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,115 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2019-12-07 18:16:22,186 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 11 treesize of output 7 [2019-12-07 18:16:22,186 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,191 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 18:16:22,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,286 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 37 treesize of output 51 [2019-12-07 18:16:22,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:22,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:22,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:22,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:16:22,303 INFO L614 ElimStorePlain]: treesize reduction 35, result has 47.8 percent of original size [2019-12-07 18:16:22,303 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 18:16:22,304 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-12-07 18:16:22,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:22,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 89 [2019-12-07 18:16:22,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:22,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,872 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 18:16:22,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:16 [2019-12-07 18:16:22,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:16:22,967 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 18:16:22,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:22,972 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:22,972 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 18:16:22,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-12-07 18:16:23,012 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 18:16:23,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:23,014 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:23,014 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 18:16:23,014 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 18:16:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:23,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:23,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 51 [2019-12-07 18:16:23,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888981721] [2019-12-07 18:16:23,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 18:16:23,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 18:16:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2513, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:16:23,027 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 52 states. [2019-12-07 18:16:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:26,629 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-12-07 18:16:26,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:16:26,630 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 56 [2019-12-07 18:16:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:26,630 INFO L225 Difference]: With dead ends: 112 [2019-12-07 18:16:26,630 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 18:16:26,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=359, Invalid=5341, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 18:16:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 18:16:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-12-07 18:16:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 18:16:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-12-07 18:16:26,634 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 56 [2019-12-07 18:16:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:26,634 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-12-07 18:16:26,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 18:16:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-12-07 18:16:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:16:26,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:26,635 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:26,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:26,836 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1281221693, now seen corresponding path program 1 times [2019-12-07 18:16:26,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:26,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553770887] [2019-12-07 18:16:26,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:16:27,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553770887] [2019-12-07 18:16:27,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648016464] [2019-12-07 18:16:27,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:27,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 77 conjunts are in the unsatisfiable core [2019-12-07 18:16:27,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:27,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 18:16:27,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:27,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:27,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:27,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:16:27,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:27,636 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 18:16:27,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:27,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:27,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:27,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-12-07 18:16:27,716 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 11 treesize of output 7 [2019-12-07 18:16:27,716 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:27,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:27,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:27,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 18:16:27,817 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:27,818 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 37 treesize of output 51 [2019-12-07 18:16:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:27,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:16:27,835 INFO L614 ElimStorePlain]: treesize reduction 35, result has 49.3 percent of original size [2019-12-07 18:16:27,836 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 18:16:27,836 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-12-07 18:16:28,810 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 68 treesize of output 52 [2019-12-07 18:16:28,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:28,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:28,821 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 18:16:28,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:71 [2019-12-07 18:16:29,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:29,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 229 [2019-12-07 18:16:29,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,288 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:16:29,337 INFO L614 ElimStorePlain]: treesize reduction 72, result has 42.4 percent of original size [2019-12-07 18:16:29,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:29,338 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:16:29,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:91, output treesize:96 [2019-12-07 18:16:29,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:29,448 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 46 treesize of output 33 [2019-12-07 18:16:29,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:29,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:16:29,458 INFO L614 ElimStorePlain]: treesize reduction 28, result has 24.3 percent of original size [2019-12-07 18:16:29,459 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 18:16:29,459 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:5 [2019-12-07 18:16:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:29,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:29,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 50 [2019-12-07 18:16:29,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799359580] [2019-12-07 18:16:29,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 18:16:29,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 18:16:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2416, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:16:29,475 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 51 states. [2019-12-07 18:16:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:32,449 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-12-07 18:16:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 18:16:32,449 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57 [2019-12-07 18:16:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:32,450 INFO L225 Difference]: With dead ends: 109 [2019-12-07 18:16:32,450 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 18:16:32,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=356, Invalid=5046, Unknown=0, NotChecked=0, Total=5402 [2019-12-07 18:16:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 18:16:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-12-07 18:16:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 18:16:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-12-07 18:16:32,452 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 57 [2019-12-07 18:16:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:32,453 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-12-07 18:16:32,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 18:16:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-12-07 18:16:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:16:32,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:32,453 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:32,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:32,654 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:32,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:32,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1063166642, now seen corresponding path program 1 times [2019-12-07 18:16:32,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:32,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750801311] [2019-12-07 18:16:32,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:16:33,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750801311] [2019-12-07 18:16:33,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882481759] [2019-12-07 18:16:33,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-07 18:16:33,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:33,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 18:16:33,347 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:33,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:33,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:33,350 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:16:33,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:33,356 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 18:16:33,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:33,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:33,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:33,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-12-07 18:16:33,448 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 11 treesize of output 7 [2019-12-07 18:16:33,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:33,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:33,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:33,453 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 18:16:33,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:33,571 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 37 treesize of output 51 [2019-12-07 18:16:33,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,572 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:33,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:33,579 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 18:16:33,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-12-07 18:16:34,435 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 68 treesize of output 52 [2019-12-07 18:16:34,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:34,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:34,464 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 18:16:34,464 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:68 [2019-12-07 18:16:35,265 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-12-07 18:16:35,265 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:35,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 299 [2019-12-07 18:16:35,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:35,399 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 18:16:35,568 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 48 [2019-12-07 18:16:35,569 INFO L614 ElimStorePlain]: treesize reduction 15464, result has 0.7 percent of original size [2019-12-07 18:16:35,569 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 18:16:35,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:88, output treesize:89 [2019-12-07 18:16:35,680 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:35,680 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 46 treesize of output 33 [2019-12-07 18:16:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:35,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:35,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:35,685 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 18:16:35,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:5 [2019-12-07 18:16:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:35,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:35,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2019-12-07 18:16:35,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531741764] [2019-12-07 18:16:35,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 18:16:35,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:35,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 18:16:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 18:16:35,701 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 49 states. [2019-12-07 18:16:38,429 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-12-07 18:16:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:40,684 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-12-07 18:16:40,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:16:40,684 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 58 [2019-12-07 18:16:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:40,685 INFO L225 Difference]: With dead ends: 107 [2019-12-07 18:16:40,685 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 18:16:40,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=333, Invalid=4779, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 18:16:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 18:16:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-12-07 18:16:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 18:16:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-12-07 18:16:40,687 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 58 [2019-12-07 18:16:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:40,688 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-12-07 18:16:40,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 18:16:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-12-07 18:16:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:16:40,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:40,688 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:40,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:40,889 INFO L410 AbstractCegarLoop]: === Iteration 32 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1401572646, now seen corresponding path program 1 times [2019-12-07 18:16:40,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:40,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449320128] [2019-12-07 18:16:40,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 18:16:41,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449320128] [2019-12-07 18:16:41,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:41,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:41,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829516762] [2019-12-07 18:16:41,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:41,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:41,015 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 11 states. [2019-12-07 18:16:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:41,281 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-12-07 18:16:41,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:16:41,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 18:16:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:41,282 INFO L225 Difference]: With dead ends: 106 [2019-12-07 18:16:41,282 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 18:16:41,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:16:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 18:16:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-12-07 18:16:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 18:16:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-12-07 18:16:41,284 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 59 [2019-12-07 18:16:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:41,285 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-12-07 18:16:41,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-12-07 18:16:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:16:41,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:41,285 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:41,285 INFO L410 AbstractCegarLoop]: === Iteration 33 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:16:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:41,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1651290050, now seen corresponding path program 1 times [2019-12-07 18:16:41,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:41,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883490558] [2019-12-07 18:16:41,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:16:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883490558] [2019-12-07 18:16:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146131239] [2019-12-07 18:16:42,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:16:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:42,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 122 conjunts are in the unsatisfiable core [2019-12-07 18:16:42,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:42,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:42,498 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 18:16:42,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:42,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:42,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:16:42,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-12-07 18:16:42,584 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 11 treesize of output 7 [2019-12-07 18:16:42,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:42,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:42,591 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 18:16:42,592 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2019-12-07 18:16:42,694 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 26 treesize of output 21 [2019-12-07 18:16:42,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:42,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:42,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:16:42,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2019-12-07 18:16:46,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:49,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:49,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:49,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 88 [2019-12-07 18:16:49,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:50,037 INFO L614 ElimStorePlain]: treesize reduction 38, result has 89.3 percent of original size [2019-12-07 18:16:50,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:50,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 88 [2019-12-07 18:16:50,053 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:16:50,148 INFO L614 ElimStorePlain]: treesize reduction 38, result has 89.9 percent of original size [2019-12-07 18:16:50,148 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 18:16:50,148 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:299, output treesize:337 [2019-12-07 18:16:50,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:50,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:50,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:50,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:50,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:54,968 INFO L430 ElimStorePlain]: Different costs {15=[|v_#memory_$Pointer$.offset_BEFORE_CALL_9|], 33=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_47|]} [2019-12-07 18:16:54,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:54,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:54,996 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 268 treesize of output 223 [2019-12-07 18:16:54,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:54,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:54,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:54,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:54,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:54,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,007 INFO L534 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2019-12-07 18:16:55,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:55,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:55,088 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 334 treesize of output 273 [2019-12-07 18:16:55,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,100 INFO L534 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2019-12-07 18:16:55,157 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:16:55,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:16:55,171 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 334 treesize of output 261 [2019-12-07 18:16:55,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:55,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:55,182 INFO L534 ElimStorePlain]: Start of recursive call 4: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2019-12-07 18:17:02,956 WARN L192 SmtUtils]: Spent 7.77 s on a formula simplification. DAG size of input: 415 DAG size of output: 153 [2019-12-07 18:17:02,957 INFO L614 ElimStorePlain]: treesize reduction 6060, result has 17.7 percent of original size [2019-12-07 18:17:02,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:17:03,030 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 18:17:03,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 55 [2019-12-07 18:17:03,031 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,039 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:17:03,071 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 18:17:03,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 55 [2019-12-07 18:17:03,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,072 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,079 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:17:03,110 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 18:17:03,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 55 [2019-12-07 18:17:03,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,112 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:17:03,143 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 18:17:03,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 55 [2019-12-07 18:17:03,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,144 INFO L534 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,233 INFO L614 ElimStorePlain]: treesize reduction 113, result has 58.6 percent of original size [2019-12-07 18:17:03,274 INFO L343 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2019-12-07 18:17:03,274 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 153 treesize of output 69 [2019-12-07 18:17:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,276 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:17:03,312 INFO L343 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2019-12-07 18:17:03,312 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 159 treesize of output 63 [2019-12-07 18:17:03,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,314 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,355 INFO L343 Elim1Store]: treesize reduction 78, result has 25.7 percent of original size [2019-12-07 18:17:03,355 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 205 treesize of output 93 [2019-12-07 18:17:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,358 INFO L534 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,391 INFO L343 Elim1Store]: treesize reduction 78, result has 25.7 percent of original size [2019-12-07 18:17:03,391 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 205 treesize of output 93 [2019-12-07 18:17:03,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:03,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,396 INFO L534 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:17:03,477 INFO L614 ElimStorePlain]: treesize reduction 216, result has 36.7 percent of original size [2019-12-07 18:17:03,684 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 127 [2019-12-07 18:17:03,684 INFO L614 ElimStorePlain]: treesize reduction 30, result has 92.6 percent of original size [2019-12-07 18:17:03,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:03,686 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 3 xjuncts. [2019-12-07 18:17:03,686 INFO L239 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:925, output treesize:334 [2019-12-07 18:17:03,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:04,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:04,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:17:04,656 INFO L430 ElimStorePlain]: Different costs {2=[v_prenex_24], 5=[|#memory_$Pointer$.base|, v_prenex_22]} [2019-12-07 18:17:04,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:17:04,662 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 43 treesize of output 31 [2019-12-07 18:17:04,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:17:04,705 INFO L614 ElimStorePlain]: treesize reduction 26, result has 82.1 percent of original size [2019-12-07 18:17:04,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:17:04,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:17:04,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 46 [2019-12-07 18:17:04,717 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:17:04,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:17:04,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:17:04,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:17:04,735 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 18 [2019-12-07 18:17:04,735 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:17:04,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:17:04,746 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 18:17:04,747 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:175, output treesize:37 [2019-12-07 18:17:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:04,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:04,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 40] total 72 [2019-12-07 18:17:04,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617819778] [2019-12-07 18:17:04,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-12-07 18:17:04,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-12-07 18:17:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=5002, Unknown=4, NotChecked=0, Total=5256 [2019-12-07 18:17:04,890 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 73 states. [2019-12-07 18:17:20,719 WARN L192 SmtUtils]: Spent 6.99 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-07 18:17:29,031 WARN L192 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-12-07 18:17:37,021 WARN L192 SmtUtils]: Spent 7.80 s on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-12-07 18:17:39,617 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 18:17:40,532 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 75 [2019-12-07 18:17:41,527 WARN L192 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 71 [2019-12-07 18:17:41,779 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 75 [2019-12-07 18:17:42,788 WARN L192 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2019-12-07 18:17:43,119 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 87 [2019-12-07 18:17:44,172 WARN L192 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 80 [2019-12-07 18:17:44,859 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 79 [2019-12-07 18:17:45,844 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 81 [2019-12-07 18:17:46,500 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 78 [2019-12-07 18:17:51,338 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 80 [2019-12-07 18:18:01,565 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 80 [2019-12-07 18:18:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:11,954 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2019-12-07 18:18:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 18:18:11,955 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 67 [2019-12-07 18:18:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:11,956 INFO L225 Difference]: With dead ends: 172 [2019-12-07 18:18:11,956 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 18:18:11,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=1007, Invalid=13505, Unknown=8, NotChecked=0, Total=14520 [2019-12-07 18:18:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 18:18:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 120. [2019-12-07 18:18:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 18:18:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2019-12-07 18:18:11,959 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 67 [2019-12-07 18:18:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:11,959 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2019-12-07 18:18:11,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-12-07 18:18:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2019-12-07 18:18:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:18:11,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:11,959 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:18:12,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:12,161 INFO L410 AbstractCegarLoop]: === Iteration 34 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:18:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:12,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1651290051, now seen corresponding path program 1 times [2019-12-07 18:18:12,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:12,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809058311] [2019-12-07 18:18:12,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:18:12,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809058311] [2019-12-07 18:18:12,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754648653] [2019-12-07 18:18:12,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:18:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:12,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-07 18:18:12,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:12,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,624 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 61 treesize of output 48 [2019-12-07 18:18:12,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:12,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:12,625 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 18:18:12,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,641 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 39 treesize of output 34 [2019-12-07 18:18:12,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:12,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:12,642 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:12,646 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,647 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:12,647 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:13 [2019-12-07 18:18:12,650 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 18:18:12,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:12,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,658 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 18:18:12,658 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:12,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,663 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 18:18:12,663 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23 [2019-12-07 18:18:12,734 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 23 treesize of output 15 [2019-12-07 18:18:12,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:12,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,740 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 26 treesize of output 14 [2019-12-07 18:18:12,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:12,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:12,743 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 18:18:12,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-12-07 18:18:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:18:12,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:12,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 24 [2019-12-07 18:18:12,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438180634] [2019-12-07 18:18:12,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 18:18:12,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 18:18:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:18:12,753 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 25 states. [2019-12-07 18:18:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:15,944 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2019-12-07 18:18:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 18:18:15,944 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-07 18:18:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:15,945 INFO L225 Difference]: With dead ends: 197 [2019-12-07 18:18:15,945 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 18:18:15,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=577, Invalid=2845, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 18:18:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 18:18:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 161. [2019-12-07 18:18:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 18:18:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2019-12-07 18:18:15,948 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 67 [2019-12-07 18:18:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:15,948 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2019-12-07 18:18:15,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 18:18:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2019-12-07 18:18:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:18:15,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:15,949 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:18:16,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:16,150 INFO L410 AbstractCegarLoop]: === Iteration 35 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:18:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:16,151 INFO L82 PathProgramCache]: Analyzing trace with hash 798000832, now seen corresponding path program 1 times [2019-12-07 18:18:16,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:16,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142181560] [2019-12-07 18:18:16,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:18:16,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142181560] [2019-12-07 18:18:16,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20202703] [2019-12-07 18:18:16,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:18:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:16,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 89 conjunts are in the unsatisfiable core [2019-12-07 18:18:16,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:16,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:16,858 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 18:18:16,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:16,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:16,861 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:16,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:18:16,863 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 11 treesize of output 7 [2019-12-07 18:18:16,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:16,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:16,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:16,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 18:18:16,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, 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 18:18:16,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:16,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:16,900 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 18:18:16,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-12-07 18:18:17,212 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 23 treesize of output 19 [2019-12-07 18:18:17,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:17,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:17,213 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:17,213 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 18:18:17,215 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_55|], 6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_55|]} [2019-12-07 18:18:17,217 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 43 treesize of output 31 [2019-12-07 18:18:17,217 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 18:18:17,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:17,232 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:17,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 41 [2019-12-07 18:18:17,233 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:17,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:17,237 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 18:18:17,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:11 [2019-12-07 18:18:17,333 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 18:18:17,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:17,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:17,334 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 18:18:17,334 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 18:18:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:18:17,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:17,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 44 [2019-12-07 18:18:17,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861881628] [2019-12-07 18:18:17,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 18:18:17,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 18:18:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1860, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:18:17,349 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 45 states. [2019-12-07 18:18:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:21,439 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2019-12-07 18:18:21,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 18:18:21,439 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 72 [2019-12-07 18:18:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:21,440 INFO L225 Difference]: With dead ends: 200 [2019-12-07 18:18:21,440 INFO L226 Difference]: Without dead ends: 200 [2019-12-07 18:18:21,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=445, Invalid=4811, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 18:18:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-07 18:18:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 171. [2019-12-07 18:18:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 18:18:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2019-12-07 18:18:21,444 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 72 [2019-12-07 18:18:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:21,444 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2019-12-07 18:18:21,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 18:18:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2019-12-07 18:18:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 18:18:21,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:21,444 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:18:21,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:21,646 INFO L410 AbstractCegarLoop]: === Iteration 36 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:18:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1031777852, now seen corresponding path program 1 times [2019-12-07 18:18:21,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:21,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391620873] [2019-12-07 18:18:21,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:18:22,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391620873] [2019-12-07 18:18:22,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090812797] [2019-12-07 18:18:22,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:18:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:22,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 87 conjunts are in the unsatisfiable core [2019-12-07 18:18:22,253 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:22,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 18:18:22,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:18:22,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,340 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 18:18:22,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,343 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 18:18:22,404 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 11 treesize of output 7 [2019-12-07 18:18:22,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,408 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,408 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 18:18:22,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,484 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 37 treesize of output 51 [2019-12-07 18:18:22,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:22,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,489 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 18:18:22,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 18:18:22,678 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_14|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_16|]} [2019-12-07 18:18:22,679 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 61 treesize of output 49 [2019-12-07 18:18:22,680 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 18:18:22,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,699 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 18:18:22,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:22,700 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:22,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:22,702 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 18:18:22,702 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:7 [2019-12-07 18:18:23,067 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 18:18:23,067 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:23,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:23,071 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 18:18:23,071 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 18:18:23,113 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_15|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_17|]} [2019-12-07 18:18:23,115 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 80 treesize of output 64 [2019-12-07 18:18:23,115 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 18:18:23,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:23,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:23,134 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62 [2019-12-07 18:18:23,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:23,135 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 18:18:23,142 INFO L614 ElimStorePlain]: treesize reduction 15, result has 46.4 percent of original size [2019-12-07 18:18:23,142 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 18:18:23,142 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:13 [2019-12-07 18:18:23,262 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 17 treesize of output 9 [2019-12-07 18:18:23,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:23,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:23,264 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 18:18:23,264 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-12-07 18:18:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:18:23,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:23,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 51 [2019-12-07 18:18:23,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331610918] [2019-12-07 18:18:23,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 18:18:23,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 18:18:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2507, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:18:23,281 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand 52 states. [2019-12-07 18:18:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:26,436 INFO L93 Difference]: Finished difference Result 199 states and 232 transitions. [2019-12-07 18:18:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 18:18:26,436 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 73 [2019-12-07 18:18:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:26,437 INFO L225 Difference]: With dead ends: 199 [2019-12-07 18:18:26,437 INFO L226 Difference]: Without dead ends: 199 [2019-12-07 18:18:26,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=553, Invalid=6089, Unknown=0, NotChecked=0, Total=6642 [2019-12-07 18:18:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-12-07 18:18:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2019-12-07 18:18:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 18:18:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 203 transitions. [2019-12-07 18:18:26,441 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 203 transitions. Word has length 73 [2019-12-07 18:18:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:26,441 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 203 transitions. [2019-12-07 18:18:26,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 18:18:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 203 transitions. [2019-12-07 18:18:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 18:18:26,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:26,442 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:18:26,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:26,642 INFO L410 AbstractCegarLoop]: === Iteration 37 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:18:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash 598933895, now seen corresponding path program 1 times [2019-12-07 18:18:26,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:26,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800908913] [2019-12-07 18:18:26,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:18:27,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800908913] [2019-12-07 18:18:27,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141731598] [2019-12-07 18:18:27,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:18:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:27,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-07 18:18:27,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:27,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:27,254 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 61 treesize of output 48 [2019-12-07 18:18:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,256 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 18:18:27,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:18:27,267 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:48 [2019-12-07 18:18:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:27,631 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 47 treesize of output 95 [2019-12-07 18:18:27,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,637 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 18:18:27,727 INFO L614 ElimStorePlain]: treesize reduction 52, result has 72.2 percent of original size [2019-12-07 18:18:27,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:27,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 79 [2019-12-07 18:18:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,758 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 18:18:27,835 INFO L614 ElimStorePlain]: treesize reduction 40, result has 75.9 percent of original size [2019-12-07 18:18:27,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:27,860 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 39 treesize of output 83 [2019-12-07 18:18:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:27,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,864 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:18:27,937 INFO L614 ElimStorePlain]: treesize reduction 44, result has 72.7 percent of original size [2019-12-07 18:18:27,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-12-07 18:18:27,938 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:148, output treesize:117 [2019-12-07 18:18:27,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:27,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:28,199 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 10 treesize of output 9 [2019-12-07 18:18:28,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:28,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:28,206 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 18:18:28,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:34 [2019-12-07 18:18:28,260 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_50|], 12=[|v_#memory_$Pointer$.base_61|]} [2019-12-07 18:18:28,262 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 18:18:28,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:28,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:28,314 INFO L343 Elim1Store]: treesize reduction 36, result has 63.6 percent of original size [2019-12-07 18:18:28,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 84 [2019-12-07 18:18:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,316 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 18:18:28,349 INFO L614 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-12-07 18:18:28,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,350 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 18:18:28,350 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:76 [2019-12-07 18:18:28,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:28,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,456 INFO L430 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 30=[|#memory_$Pointer$.base|]} [2019-12-07 18:18:29,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:29,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 80 [2019-12-07 18:18:29,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,480 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 18:18:29,496 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:29,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 84 [2019-12-07 18:18:29,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,498 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 18:18:29,585 INFO L614 ElimStorePlain]: treesize reduction 27, result has 86.8 percent of original size [2019-12-07 18:18:29,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:18:29,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:29,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 66 treesize of output 120 [2019-12-07 18:18:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,634 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:29,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:18:29,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:29,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 71 treesize of output 113 [2019-12-07 18:18:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,667 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:29,723 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.1 percent of original size [2019-12-07 18:18:29,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:29,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 18:18:29,724 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:229, output treesize:51 [2019-12-07 18:18:30,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:30,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 55 [2019-12-07 18:18:30,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:30,176 INFO L614 ElimStorePlain]: treesize reduction 28, result has 41.7 percent of original size [2019-12-07 18:18:30,177 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 18:18:30,177 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2019-12-07 18:18:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:18:30,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:30,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2019-12-07 18:18:30,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096260323] [2019-12-07 18:18:30,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 18:18:30,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:30,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 18:18:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:18:30,377 INFO L87 Difference]: Start difference. First operand 174 states and 203 transitions. Second operand 45 states. [2019-12-07 18:18:32,041 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 18:18:32,556 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-12-07 18:18:33,135 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 49 [2019-12-07 18:18:33,528 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-07 18:18:34,549 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2019-12-07 18:18:34,764 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 104 [2019-12-07 18:18:35,025 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 114 [2019-12-07 18:18:35,281 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 110 [2019-12-07 18:18:35,544 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 115 [2019-12-07 18:18:35,921 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 109 [2019-12-07 18:18:36,176 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 114 [2019-12-07 18:18:36,489 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 118 [2019-12-07 18:18:36,758 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 114 [2019-12-07 18:18:37,104 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 114 [2019-12-07 18:18:37,457 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 113 [2019-12-07 18:18:37,887 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 129 [2019-12-07 18:18:38,190 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 120 [2019-12-07 18:18:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:41,276 INFO L93 Difference]: Finished difference Result 292 states and 330 transitions. [2019-12-07 18:18:41,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-07 18:18:41,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 75 [2019-12-07 18:18:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:41,278 INFO L225 Difference]: With dead ends: 292 [2019-12-07 18:18:41,278 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 18:18:41,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2540 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1140, Invalid=8366, Unknown=0, NotChecked=0, Total=9506 [2019-12-07 18:18:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 18:18:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 238. [2019-12-07 18:18:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-12-07 18:18:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2019-12-07 18:18:41,282 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 75 [2019-12-07 18:18:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:41,283 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2019-12-07 18:18:41,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 18:18:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2019-12-07 18:18:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 18:18:41,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:41,283 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:18:41,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:41,484 INFO L410 AbstractCegarLoop]: === Iteration 38 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:18:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash -232303610, now seen corresponding path program 1 times [2019-12-07 18:18:41,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:41,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919726658] [2019-12-07 18:18:41,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:18:42,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919726658] [2019-12-07 18:18:42,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686670419] [2019-12-07 18:18:42,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:18:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:42,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 122 conjunts are in the unsatisfiable core [2019-12-07 18:18:42,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:43,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 18:18:43,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:43,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:43,152 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:43,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:18:43,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:43,157 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 18:18:43,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:43,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:43,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:43,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 18:18:43,612 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 11 treesize of output 7 [2019-12-07 18:18:43,613 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:43,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:43,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:43,635 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 18:18:44,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:44,031 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 37 treesize of output 51 [2019-12-07 18:18:44,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:44,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:44,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:44,040 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 18:18:44,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 18:18:45,230 INFO L430 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_BEFORE_CALL_18|], 18=[|v_#memory_$Pointer$.base_BEFORE_CALL_21|]} [2019-12-07 18:18:45,257 INFO L343 Elim1Store]: treesize reduction 106, result has 24.8 percent of original size [2019-12-07 18:18:45,258 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 331 treesize of output 190 [2019-12-07 18:18:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,259 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:18:45,290 INFO L614 ElimStorePlain]: treesize reduction 28, result has 88.5 percent of original size [2019-12-07 18:18:45,361 INFO L343 Elim1Store]: treesize reduction 97, result has 46.7 percent of original size [2019-12-07 18:18:45,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 213 treesize of output 146 [2019-12-07 18:18:45,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:18:45,369 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 18:18:45,411 INFO L614 ElimStorePlain]: treesize reduction 46, result has 73.6 percent of original size [2019-12-07 18:18:45,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 18:18:45,413 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:334, output treesize:128 [2019-12-07 18:18:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:45,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:46,208 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-07 18:18:46,626 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 18:18:46,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:47,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:18:47,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:47,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 147 [2019-12-07 18:18:47,139 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:47,211 INFO L614 ElimStorePlain]: treesize reduction 45, result has 82.1 percent of original size [2019-12-07 18:18:47,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:18:47,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:47,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 27 [2019-12-07 18:18:47,218 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:47,244 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:47,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:18:47,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:47,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 53 [2019-12-07 18:18:47,251 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:47,293 INFO L614 ElimStorePlain]: treesize reduction 5, result has 95.0 percent of original size [2019-12-07 18:18:47,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:18:47,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 84 [2019-12-07 18:18:47,314 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:18:47,345 INFO L614 ElimStorePlain]: treesize reduction 24, result has 66.2 percent of original size [2019-12-07 18:18:47,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:18:47,345 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:283, output treesize:7 [2019-12-07 18:18:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:18:47,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:47,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 64 [2019-12-07 18:18:47,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828356875] [2019-12-07 18:18:47,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-12-07 18:18:47,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-12-07 18:18:47,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3854, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 18:18:47,386 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand 64 states. [2019-12-07 18:18:50,596 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-12-07 18:18:51,549 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-12-07 18:18:51,881 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 66 [2019-12-07 18:18:52,277 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 74 [2019-12-07 18:18:52,632 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 82 [2019-12-07 18:18:52,997 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 78 [2019-12-07 18:18:53,506 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 86 [2019-12-07 18:18:53,925 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 90 [2019-12-07 18:18:54,387 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 99 [2019-12-07 18:18:54,899 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 103 [2019-12-07 18:18:57,238 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 140 DAG size of output: 63 [2019-12-07 18:19:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:19:00,064 INFO L93 Difference]: Finished difference Result 223 states and 246 transitions. [2019-12-07 18:19:00,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 18:19:00,064 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 78 [2019-12-07 18:19:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:19:00,065 INFO L225 Difference]: With dead ends: 223 [2019-12-07 18:19:00,065 INFO L226 Difference]: Without dead ends: 213 [2019-12-07 18:19:00,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=925, Invalid=11731, Unknown=0, NotChecked=0, Total=12656 [2019-12-07 18:19:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-07 18:19:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 200. [2019-12-07 18:19:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-07 18:19:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2019-12-07 18:19:00,069 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 78 [2019-12-07 18:19:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:19:00,069 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2019-12-07 18:19:00,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-12-07 18:19:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2019-12-07 18:19:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 18:19:00,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:19:00,069 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:19:00,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:00,270 INFO L410 AbstractCegarLoop]: === Iteration 39 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:19:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:19:00,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1685169181, now seen corresponding path program 1 times [2019-12-07 18:19:00,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:19:00,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14602224] [2019-12-07 18:19:00,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:19:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:02,066 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-07 18:19:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:19:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14602224] [2019-12-07 18:19:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919766726] [2019-12-07 18:19:02,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:19:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:02,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 135 conjunts are in the unsatisfiable core [2019-12-07 18:19:02,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:19:03,021 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:19:03,041 INFO L614 ElimStorePlain]: treesize reduction 21, result has 65.6 percent of original size [2019-12-07 18:19:03,041 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:19:03,042 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:40 [2019-12-07 18:19:03,214 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 18:19:03,215 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:19:03,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:19:03,224 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 18:19:03,224 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2019-12-07 18:19:03,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:19:03,424 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 41 treesize of output 55 [2019-12-07 18:19:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:03,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:03,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:19:03,466 INFO L614 ElimStorePlain]: treesize reduction 139, result has 28.7 percent of original size [2019-12-07 18:19:03,466 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 18:19:03,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:56 [2019-12-07 18:19:13,561 WARN L192 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 18:19:15,714 WARN L192 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 18:19:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:17,718 WARN L192 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 18:19:17,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:17,731 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 11 treesize of output 7 [2019-12-07 18:19:17,731 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:19:17,741 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 18:19:17,741 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:19:17,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:19:17,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 18:19:17,778 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:383, output treesize:365 [2019-12-07 18:19:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:17,996 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_21|], 38=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_71|]} [2019-12-07 18:19:18,001 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 271 treesize of output 207 [2019-12-07 18:19:18,001 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 18:19:18,006 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 279 treesize of output 215 [2019-12-07 18:19:18,007 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 18:19:18,177 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-12-07 18:19:18,177 INFO L614 ElimStorePlain]: treesize reduction 16, result has 96.6 percent of original size [2019-12-07 18:19:18,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:19:18,253 INFO L343 Elim1Store]: treesize reduction 85, result has 48.8 percent of original size [2019-12-07 18:19:18,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 172 [2019-12-07 18:19:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,257 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:19:18,263 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:19:18,327 INFO L343 Elim1Store]: treesize reduction 85, result has 48.8 percent of original size [2019-12-07 18:19:18,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 172 [2019-12-07 18:19:18,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:18,352 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:19:18,489 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 71 [2019-12-07 18:19:18,489 INFO L614 ElimStorePlain]: treesize reduction 192, result has 53.5 percent of original size [2019-12-07 18:19:18,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-12-07 18:19:18,491 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:597, output treesize:221 [2019-12-07 18:19:18,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:18,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:19,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:19,368 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_72|], 20=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_72|]} [2019-12-07 18:19:19,372 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 7 treesize of output 3 [2019-12-07 18:19:19,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:19:19,377 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 7 treesize of output 3 [2019-12-07 18:19:19,378 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:19:19,467 INFO L614 ElimStorePlain]: treesize reduction 10, result has 95.6 percent of original size [2019-12-07 18:19:19,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:19:19,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:19:19,487 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 73 treesize of output 76 [2019-12-07 18:19:19,488 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:19:19,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:19:19,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:19:19,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 122 [2019-12-07 18:19:19,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:19,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:19,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:19,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:19:19,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:19,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:19:19,516 INFO L534 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:19:19,579 INFO L614 ElimStorePlain]: treesize reduction 16, result has 88.1 percent of original size [2019-12-07 18:19:19,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-12-07 18:19:19,579 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:239, output treesize:103 [2019-12-07 18:19:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:19:19,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:19:19,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 70 [2019-12-07 18:19:19,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830233630] [2019-12-07 18:19:19,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-12-07 18:19:19,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:19:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-12-07 18:19:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4724, Unknown=10, NotChecked=0, Total=4970 [2019-12-07 18:19:19,916 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand 71 states. [2019-12-07 18:19:44,187 WARN L192 SmtUtils]: Spent 7.40 s on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-12-07 18:19:48,165 WARN L192 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-07 18:20:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:00,294 INFO L93 Difference]: Finished difference Result 214 states and 243 transitions. [2019-12-07 18:20:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 18:20:00,294 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 82 [2019-12-07 18:20:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:00,295 INFO L225 Difference]: With dead ends: 214 [2019-12-07 18:20:00,295 INFO L226 Difference]: Without dead ends: 213 [2019-12-07 18:20:00,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2491 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=506, Invalid=8786, Unknown=20, NotChecked=0, Total=9312 [2019-12-07 18:20:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-07 18:20:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 204. [2019-12-07 18:20:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-07 18:20:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 235 transitions. [2019-12-07 18:20:00,300 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 235 transitions. Word has length 82 [2019-12-07 18:20:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:00,301 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 235 transitions. [2019-12-07 18:20:00,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-12-07 18:20:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 235 transitions. [2019-12-07 18:20:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 18:20:00,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:00,301 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:00,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:20:00,502 INFO L410 AbstractCegarLoop]: === Iteration 40 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:20:00,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1685169246, now seen corresponding path program 1 times [2019-12-07 18:20:00,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:00,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590551288] [2019-12-07 18:20:00,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 18:20:00,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590551288] [2019-12-07 18:20:00,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:00,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:20:00,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098740937] [2019-12-07 18:20:00,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:20:00,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:00,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:20:00,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:20:00,594 INFO L87 Difference]: Start difference. First operand 204 states and 235 transitions. Second operand 9 states. [2019-12-07 18:20:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:00,887 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2019-12-07 18:20:00,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:20:00,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-12-07 18:20:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:00,888 INFO L225 Difference]: With dead ends: 213 [2019-12-07 18:20:00,888 INFO L226 Difference]: Without dead ends: 211 [2019-12-07 18:20:00,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:20:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-12-07 18:20:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2019-12-07 18:20:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-07 18:20:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 234 transitions. [2019-12-07 18:20:00,892 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 234 transitions. Word has length 82 [2019-12-07 18:20:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:00,892 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 234 transitions. [2019-12-07 18:20:00,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:20:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 234 transitions. [2019-12-07 18:20:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:20:00,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:00,893 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:00,894 INFO L410 AbstractCegarLoop]: === Iteration 41 === [sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 18:20:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash -695241949, now seen corresponding path program 1 times [2019-12-07 18:20:00,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:00,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995950106] [2019-12-07 18:20:00,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 18:20:00,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995950106] [2019-12-07 18:20:00,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939149092] [2019-12-07 18:20:00,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/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 18:20:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:01,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:20:01,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:20:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 18:20:01,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:20:01,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-12-07 18:20:01,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855631030] [2019-12-07 18:20:01,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:20:01,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:20:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:20:01,097 INFO L87 Difference]: Start difference. First operand 204 states and 234 transitions. Second operand 6 states. [2019-12-07 18:20:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:01,108 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-12-07 18:20:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:20:01,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-07 18:20:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:01,108 INFO L225 Difference]: With dead ends: 72 [2019-12-07 18:20:01,108 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:20:01,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:20:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:20:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:20:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:20:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:20:01,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-12-07 18:20:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:01,109 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:20:01,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:20:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:20:01,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:20:01,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:20:01,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:20:01 BoogieIcfgContainer [2019-12-07 18:20:01,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:20:01,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:20:01,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:20:01,315 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:20:01,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:15:32" (3/4) ... [2019-12-07 18:20:01,318 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:20:01,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 18:20:01,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 18:20:01,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_remove_first [2019-12-07 18:20:01,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 18:20:01,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 18:20:01,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2019-12-07 18:20:01,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 18:20:01,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 18:20:01,329 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 18:20:01,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 18:20:01,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:20:01,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:20:01,364 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00123030-2d3e-4726-badd-82f0f199a6f3/bin/uautomizer/witness.graphml [2019-12-07 18:20:01,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:20:01,365 INFO L168 Benchmark]: Toolchain (without parser) took 269196.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 937.2 MB in the beginning and 903.7 MB in the end (delta: 33.5 MB). Peak memory consumption was 166.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:01,365 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:20:01,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:01,365 INFO L168 Benchmark]: Boogie Preprocessor took 42.24 ms. Allocated memory is still 1.1 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 18:20:01,365 INFO L168 Benchmark]: RCFGBuilder took 387.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:01,366 INFO L168 Benchmark]: TraceAbstraction took 268405.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 912.7 MB in the end (delta: 95.4 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:01,366 INFO L168 Benchmark]: Witness Printer took 49.53 ms. Allocated memory is still 1.2 GB. Free memory was 912.7 MB in the beginning and 903.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:01,367 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 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.24 ms. Allocated memory is still 1.1 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 387.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 268405.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 912.7 MB in the end (delta: 95.4 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.53 ms. Allocated memory is still 1.2 GB. Free memory was 912.7 MB in the beginning and 903.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 599]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 115 locations, 42 error locations. Result: SAFE, OverallTime: 268.3s, OverallIterations: 41, TraceHistogramMax: 3, AutomataDifference: 184.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2034 SDtfs, 9821 SDslu, 12820 SDs, 0 SdLazy, 50130 SolverSat, 1719 SolverUnsat, 45 SolverUnknown, 0 SolverNotchecked, 81.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2806 GetRequests, 1175 SyntacticMatches, 35 SemanticMatches, 1596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21011 ImplicationChecksByTransitivity, 156.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=37, 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, 41 MinimizatonAttempts, 603 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 76.7s InterpolantComputationTime, 3326 NumberOfCodeBlocks, 3326 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3263 ConstructedInterpolants, 274 QuantifiedInterpolants, 3899755 SizeOfPredicates, 447 NumberOfNonLiveVariables, 7310 ConjunctsInSsa, 1539 ConjunctsInUnsatCore, 63 InterpolantComputations, 20 PerfectInterpolantSequences, 445/818 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 correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...