./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.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_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:44:40,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:44:40,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:44:40,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:44:40,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:44:40,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:44:40,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:44:40,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:44:40,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:44:40,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:44:40,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:44:40,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:44:40,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:44:40,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:44:40,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:44:40,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:44:40,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:44:40,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:44:40,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:44:40,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:44:40,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:44:40,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:44:40,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:44:40,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:44:40,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:44:40,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:44:40,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:44:40,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:44:40,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:44:40,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:44:40,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:44:40,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:44:40,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:44:40,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:44:40,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:44:40,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:44:40,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:44:40,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:44:40,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:44:40,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:44:40,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:44:40,136 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 17:44:40,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:44:40,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:44:40,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:44:40,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:44:40,150 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:44:40,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:44:40,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:44:40,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:44:40,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:44:40,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:44:40,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:44:40,151 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:44:40,152 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:44:40,152 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:44:40,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:44:40,152 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:44:40,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:44:40,153 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:44:40,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:44:40,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:44:40,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:44:40,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:44:40,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:44:40,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:44:40,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:44:40,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:44:40,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:44:40,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:44:40,155 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_c28905bf-9940-4640-9854-603959d8d6aa/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 -> 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 [2019-12-07 17:44:40,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:44:40,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:44:40,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:44:40,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:44:40,277 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:44:40,278 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2019-12-07 17:44:40,317 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/data/043464f3c/1f542c2da4cd4c4b855a0d18a1f0f6e8/FLAG858004886 [2019-12-07 17:44:40,693 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:44:40,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2019-12-07 17:44:40,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/data/043464f3c/1f542c2da4cd4c4b855a0d18a1f0f6e8/FLAG858004886 [2019-12-07 17:44:40,711 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/data/043464f3c/1f542c2da4cd4c4b855a0d18a1f0f6e8 [2019-12-07 17:44:40,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:44:40,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:44:40,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:44:40,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:44:40,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:44:40,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:44:40" (1/1) ... [2019-12-07 17:44:40,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98acb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:40, skipping insertion in model container [2019-12-07 17:44:40,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:44:40" (1/1) ... [2019-12-07 17:44:40,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:44:40,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:44:40,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:44:40,995 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:44:41,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:44:41,068 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:44:41,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41 WrapperNode [2019-12-07 17:44:41,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:44:41,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:44:41,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:44:41,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:44:41,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... [2019-12-07 17:44:41,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... [2019-12-07 17:44:41,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... [2019-12-07 17:44:41,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... [2019-12-07 17:44:41,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... [2019-12-07 17:44:41,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... [2019-12-07 17:44:41,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... [2019-12-07 17:44:41,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:44:41,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:44:41,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:44:41,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:44:41,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:44:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:44:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:44:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 17:44:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 17:44:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 17:44:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 17:44:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-12-07 17:44:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_last [2019-12-07 17:44:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:44:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:44:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:44:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:44:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:44:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:44:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_last [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:44:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 17:44:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:44:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:44:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:44:41,318 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 17:44:41,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:44:41,456 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 17:44:41,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:41 BoogieIcfgContainer [2019-12-07 17:44:41,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:44:41,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:44:41,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:44:41,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:44:41,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:44:40" (1/3) ... [2019-12-07 17:44:41,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdcc1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:44:41, skipping insertion in model container [2019-12-07 17:44:41,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:41" (2/3) ... [2019-12-07 17:44:41,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdcc1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:44:41, skipping insertion in model container [2019-12-07 17:44:41,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:41" (3/3) ... [2019-12-07 17:44:41,461 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2019-12-07 17:44:41,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:44:41,473 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 17:44:41,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 17:44:41,493 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:44:41,493 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:44:41,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:44:41,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:44:41,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:44:41,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:44:41,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:44:41,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:44:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-12-07 17:44:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:44:41,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:41,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:41,512 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash 615381905, now seen corresponding path program 1 times [2019-12-07 17:44:41,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:41,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545179624] [2019-12-07 17:44:41,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:41,652 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 17:44:41,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545179624] [2019-12-07 17:44:41,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:41,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:44:41,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933228911] [2019-12-07 17:44:41,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:44:41,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:44:41,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:41,669 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2019-12-07 17:44:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:41,840 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-12-07 17:44:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:44:41,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:44:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:41,849 INFO L225 Difference]: With dead ends: 94 [2019-12-07 17:44:41,849 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 17:44:41,850 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 17:44:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 17:44:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-12-07 17:44:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 17:44:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-12-07 17:44:41,881 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 13 [2019-12-07 17:44:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:41,881 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-12-07 17:44:41,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:44:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-12-07 17:44:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:44:41,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:41,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:41,882 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 615381906, now seen corresponding path program 1 times [2019-12-07 17:44:41,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:41,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909050494] [2019-12-07 17:44:41,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:41,937 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 17:44:41,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909050494] [2019-12-07 17:44:41,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:41,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:44:41,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562922134] [2019-12-07 17:44:41,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:44:41,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:41,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:44:41,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:41,939 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 4 states. [2019-12-07 17:44:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:42,056 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-12-07 17:44:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:44:42,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:44:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:42,057 INFO L225 Difference]: With dead ends: 86 [2019-12-07 17:44:42,057 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 17:44:42,058 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 17:44:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 17:44:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2019-12-07 17:44:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 17:44:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-12-07 17:44:42,064 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 13 [2019-12-07 17:44:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:42,064 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-12-07 17:44:42,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:44:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-12-07 17:44:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:44:42,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:42,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:42,065 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2007645082, now seen corresponding path program 1 times [2019-12-07 17:44:42,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:42,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298753636] [2019-12-07 17:44:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,124 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 17:44:42,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298753636] [2019-12-07 17:44:42,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:42,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:44:42,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314984841] [2019-12-07 17:44:42,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:44:42,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:42,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:44:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:44:42,126 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 6 states. [2019-12-07 17:44:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:42,305 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-12-07 17:44:42,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:44:42,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 17:44:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:42,307 INFO L225 Difference]: With dead ends: 89 [2019-12-07 17:44:42,307 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 17:44:42,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 17:44:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2019-12-07 17:44:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 17:44:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-12-07 17:44:42,314 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 15 [2019-12-07 17:44:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:42,314 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-12-07 17:44:42,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:44:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-12-07 17:44:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:44:42,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:42,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:42,315 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:42,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash -906469002, now seen corresponding path program 1 times [2019-12-07 17:44:42,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:42,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021974890] [2019-12-07 17:44:42,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,402 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 17:44:42,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021974890] [2019-12-07 17:44:42,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:42,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:42,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795190954] [2019-12-07 17:44:42,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:42,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:42,404 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 8 states. [2019-12-07 17:44:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:42,687 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-12-07 17:44:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:44:42,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 17:44:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:42,689 INFO L225 Difference]: With dead ends: 125 [2019-12-07 17:44:42,689 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 17:44:42,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:44:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 17:44:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2019-12-07 17:44:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 17:44:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-12-07 17:44:42,696 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 17 [2019-12-07 17:44:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:42,696 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-12-07 17:44:42,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-12-07 17:44:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:44:42,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:42,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:42,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash -906469001, now seen corresponding path program 1 times [2019-12-07 17:44:42,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:42,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931503161] [2019-12-07 17:44:42,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,749 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 17:44:42,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931503161] [2019-12-07 17:44:42,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:42,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:42,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273062889] [2019-12-07 17:44:42,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:44:42,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:42,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:44:42,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:44:42,751 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 7 states. [2019-12-07 17:44:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:42,936 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-12-07 17:44:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:42,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 17:44:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:42,937 INFO L225 Difference]: With dead ends: 91 [2019-12-07 17:44:42,937 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 17:44:42,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:44:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 17:44:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2019-12-07 17:44:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 17:44:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-12-07 17:44:42,942 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 17 [2019-12-07 17:44:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:42,943 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-12-07 17:44:42,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:44:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-12-07 17:44:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:44:42,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:42,943 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 17:44:42,944 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -214111467, now seen corresponding path program 1 times [2019-12-07 17:44:42,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:42,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190089277] [2019-12-07 17:44:42,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,004 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 17:44:43,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190089277] [2019-12-07 17:44:43,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:43,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:43,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424126525] [2019-12-07 17:44:43,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:43,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:43,005 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 8 states. [2019-12-07 17:44:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:43,204 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-12-07 17:44:43,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:43,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 17:44:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:43,205 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:44:43,205 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 17:44:43,206 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 17:44:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 17:44:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-12-07 17:44:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 17:44:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-12-07 17:44:43,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-12-07 17:44:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:43,211 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-12-07 17:44:43,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-12-07 17:44:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:44:43,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:43,212 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 17:44:43,213 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -214111466, now seen corresponding path program 1 times [2019-12-07 17:44:43,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:43,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529556248] [2019-12-07 17:44:43,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,292 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 17:44:43,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529556248] [2019-12-07 17:44:43,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:43,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:43,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071318769] [2019-12-07 17:44:43,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:43,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:43,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:43,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:43,294 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 8 states. [2019-12-07 17:44:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:43,485 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-12-07 17:44:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:43,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 17:44:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:43,486 INFO L225 Difference]: With dead ends: 80 [2019-12-07 17:44:43,486 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 17:44:43,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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 17:44:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 17:44:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-12-07 17:44:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 17:44:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-12-07 17:44:43,491 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 19 [2019-12-07 17:44:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:43,491 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-12-07 17:44:43,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-12-07 17:44:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:44:43,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:43,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:43,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 54475219, now seen corresponding path program 1 times [2019-12-07 17:44:43,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:43,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805880540] [2019-12-07 17:44:43,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:43,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805880540] [2019-12-07 17:44:43,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584530030] [2019-12-07 17:44:43,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:44:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:43,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:44:43,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:43,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:43,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 17:44:43,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341567237] [2019-12-07 17:44:43,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:44:43,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:44:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:44:43,676 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 9 states. [2019-12-07 17:44:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:43,894 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-12-07 17:44:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:44:43,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 17:44:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:43,895 INFO L225 Difference]: With dead ends: 93 [2019-12-07 17:44:43,895 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 17:44:43,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:44:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 17:44:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-12-07 17:44:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 17:44:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-12-07 17:44:43,899 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 30 [2019-12-07 17:44:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:43,899 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-12-07 17:44:43,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:44:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-12-07 17:44:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:44:43,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:43,900 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:44,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:44,102 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:44,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1150705514, now seen corresponding path program 2 times [2019-12-07 17:44:44,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:44,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674247649] [2019-12-07 17:44:44,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:44:44,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674247649] [2019-12-07 17:44:44,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727784774] [2019-12-07 17:44:44,582 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:44:44,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:44:44,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:44:44,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 17:44:44,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:44,693 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 17:44:44,693 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:44,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:44,695 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:44,695 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:44:44,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:44:44,849 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 17:44:44,849 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 2 case distinctions, treesize of input 15 treesize of output 31 [2019-12-07 17:44:44,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:44,875 INFO L614 ElimStorePlain]: treesize reduction 17, result has 48.5 percent of original size [2019-12-07 17:44:44,876 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 17:44:44,876 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2019-12-07 17:44:44,883 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 17:44:44,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:44,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2019-12-07 17:44:44,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190606998] [2019-12-07 17:44:44,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:44:44,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:44:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:44:44,884 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 18 states. [2019-12-07 17:44:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:45,767 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2019-12-07 17:44:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:44:45,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-12-07 17:44:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:45,769 INFO L225 Difference]: With dead ends: 136 [2019-12-07 17:44:45,769 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 17:44:45,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:44:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 17:44:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 99. [2019-12-07 17:44:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 17:44:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-12-07 17:44:45,774 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 43 [2019-12-07 17:44:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:45,774 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-12-07 17:44:45,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:44:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-12-07 17:44:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:44:45,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:45,775 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:45,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:45,976 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1150705513, now seen corresponding path program 1 times [2019-12-07 17:44:45,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:45,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961820450] [2019-12-07 17:44:45,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:46,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961820450] [2019-12-07 17:44:46,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145413391] [2019-12-07 17:44:46,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:44:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:46,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 17:44:46,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:46,345 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 17:44:46,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:46,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:46,349 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:46,350 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 17:44:46,366 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 17:44:46,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:46,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:46,369 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 17:44:46,370 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 17:44:46,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:46,472 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 17:44:46,473 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 2 case distinctions, treesize of input 15 treesize of output 33 [2019-12-07 17:44:46,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:46,488 INFO L614 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2019-12-07 17:44:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,490 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 17:44:46,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:28 [2019-12-07 17:44:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:46,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:46,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-12-07 17:44:46,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025156738] [2019-12-07 17:44:46,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 17:44:46,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 17:44:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:44:46,641 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 21 states. [2019-12-07 17:44:47,466 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-07 17:44:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:48,017 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2019-12-07 17:44:48,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:44:48,018 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2019-12-07 17:44:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:48,019 INFO L225 Difference]: With dead ends: 146 [2019-12-07 17:44:48,019 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 17:44:48,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:44:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 17:44:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2019-12-07 17:44:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 17:44:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2019-12-07 17:44:48,024 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 43 [2019-12-07 17:44:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:48,024 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2019-12-07 17:44:48,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 17:44:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2019-12-07 17:44:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:44:48,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:48,025 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:48,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:48,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:48,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1312132516, now seen corresponding path program 1 times [2019-12-07 17:44:48,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:48,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213907286] [2019-12-07 17:44:48,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:44:48,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213907286] [2019-12-07 17:44:48,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:48,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:44:48,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154787076] [2019-12-07 17:44:48,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:44:48,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:44:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:44:48,406 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 15 states. [2019-12-07 17:44:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:48,917 INFO L93 Difference]: Finished difference Result 167 states and 209 transitions. [2019-12-07 17:44:48,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:44:48,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2019-12-07 17:44:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:48,919 INFO L225 Difference]: With dead ends: 167 [2019-12-07 17:44:48,919 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 17:44:48,919 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 17:44:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 17:44:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2019-12-07 17:44:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 17:44:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 161 transitions. [2019-12-07 17:44:48,923 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 161 transitions. Word has length 44 [2019-12-07 17:44:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:48,923 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 161 transitions. [2019-12-07 17:44:48,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:44:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2019-12-07 17:44:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:44:48,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:48,924 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:48,924 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1312132515, now seen corresponding path program 1 times [2019-12-07 17:44:48,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:48,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984196865] [2019-12-07 17:44:48,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:44:49,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984196865] [2019-12-07 17:44:49,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:49,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 17:44:49,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644562823] [2019-12-07 17:44:49,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:44:49,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:49,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:44:49,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:44:49,125 INFO L87 Difference]: Start difference. First operand 129 states and 161 transitions. Second operand 16 states. [2019-12-07 17:44:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:49,660 INFO L93 Difference]: Finished difference Result 170 states and 212 transitions. [2019-12-07 17:44:49,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:44:49,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-12-07 17:44:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:49,662 INFO L225 Difference]: With dead ends: 170 [2019-12-07 17:44:49,662 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 17:44:49,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:44:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 17:44:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 129. [2019-12-07 17:44:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 17:44:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2019-12-07 17:44:49,669 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 44 [2019-12-07 17:44:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:49,669 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2019-12-07 17:44:49,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:44:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2019-12-07 17:44:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:44:49,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:49,670 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:49,670 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:49,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1242368611, now seen corresponding path program 1 times [2019-12-07 17:44:49,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:49,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316091106] [2019-12-07 17:44:49,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:44:49,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316091106] [2019-12-07 17:44:49,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:49,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:44:49,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175904352] [2019-12-07 17:44:49,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:44:49,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:44:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:44:49,820 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand 15 states. [2019-12-07 17:44:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:50,252 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2019-12-07 17:44:50,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:44:50,252 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-12-07 17:44:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:50,253 INFO L225 Difference]: With dead ends: 128 [2019-12-07 17:44:50,253 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 17:44:50,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:44:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 17:44:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-07 17:44:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 17:44:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2019-12-07 17:44:50,257 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 47 [2019-12-07 17:44:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:50,257 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2019-12-07 17:44:50,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:44:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2019-12-07 17:44:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:44:50,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:50,258 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:50,258 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash 141709794, now seen corresponding path program 1 times [2019-12-07 17:44:50,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:50,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942393244] [2019-12-07 17:44:50,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:50,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942393244] [2019-12-07 17:44:50,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:50,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:50,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516354717] [2019-12-07 17:44:50,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:50,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:50,314 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand 8 states. [2019-12-07 17:44:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:50,535 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2019-12-07 17:44:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:44:50,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-12-07 17:44:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:50,537 INFO L225 Difference]: With dead ends: 129 [2019-12-07 17:44:50,537 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 17:44:50,537 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 17:44:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 17:44:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-12-07 17:44:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 17:44:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2019-12-07 17:44:50,540 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 48 [2019-12-07 17:44:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:50,540 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2019-12-07 17:44:50,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2019-12-07 17:44:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:44:50,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:50,541 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:50,541 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash 141709795, now seen corresponding path program 1 times [2019-12-07 17:44:50,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:50,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078647744] [2019-12-07 17:44:50,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:44:50,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078647744] [2019-12-07 17:44:50,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:50,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 17:44:50,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619203301] [2019-12-07 17:44:50,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:44:50,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:50,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:44:50,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:44:50,722 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand 18 states. [2019-12-07 17:44:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:51,554 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2019-12-07 17:44:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:44:51,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-12-07 17:44:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:51,555 INFO L225 Difference]: With dead ends: 150 [2019-12-07 17:44:51,555 INFO L226 Difference]: Without dead ends: 150 [2019-12-07 17:44:51,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 17:44:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-07 17:44:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2019-12-07 17:44:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 17:44:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-12-07 17:44:51,560 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 48 [2019-12-07 17:44:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:51,561 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-12-07 17:44:51,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:44:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-12-07 17:44:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:44:51,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:51,561 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:51,561 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash 141278845, now seen corresponding path program 1 times [2019-12-07 17:44:51,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:51,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843429028] [2019-12-07 17:44:51,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:44:51,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843429028] [2019-12-07 17:44:51,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:51,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:44:51,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306031472] [2019-12-07 17:44:51,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:44:51,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:51,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:44:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:44:51,694 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 15 states. [2019-12-07 17:44:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:52,211 INFO L93 Difference]: Finished difference Result 176 states and 216 transitions. [2019-12-07 17:44:52,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:44:52,211 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-12-07 17:44:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:52,212 INFO L225 Difference]: With dead ends: 176 [2019-12-07 17:44:52,212 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 17:44:52,213 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 17:44:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 17:44:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 140. [2019-12-07 17:44:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 17:44:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2019-12-07 17:44:52,216 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 48 [2019-12-07 17:44:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:52,216 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2019-12-07 17:44:52,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:44:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2019-12-07 17:44:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:44:52,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:52,217 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:52,217 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash 84677023, now seen corresponding path program 1 times [2019-12-07 17:44:52,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:52,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66318349] [2019-12-07 17:44:52,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:52,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66318349] [2019-12-07 17:44:52,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:52,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:44:52,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522385469] [2019-12-07 17:44:52,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:44:52,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:44:52,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:44:52,269 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand 7 states. [2019-12-07 17:44:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:52,448 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2019-12-07 17:44:52,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:52,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 17:44:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:52,449 INFO L225 Difference]: With dead ends: 139 [2019-12-07 17:44:52,449 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 17:44:52,449 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 17:44:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 17:44:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-12-07 17:44:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-07 17:44:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2019-12-07 17:44:52,452 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 49 [2019-12-07 17:44:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:52,453 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2019-12-07 17:44:52,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:44:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2019-12-07 17:44:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:44:52,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:52,453 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:52,454 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1255838772, now seen corresponding path program 1 times [2019-12-07 17:44:52,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:52,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113011084] [2019-12-07 17:44:52,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:52,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113011084] [2019-12-07 17:44:52,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600052255] [2019-12-07 17:44:52,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:44:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 17:44:52,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:52,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:44:52,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:52,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:52,923 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 17:44:52,923 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-12-07 17:44:53,102 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 18 [2019-12-07 17:44:53,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:53,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:53,106 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 17:44:53,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2019-12-07 17:44:53,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:53,192 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 28 treesize of output 25 [2019-12-07 17:44:53,192 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:53,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:53,194 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 17:44:53,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:4 [2019-12-07 17:44:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:53,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:53,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 33 [2019-12-07 17:44:53,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666438352] [2019-12-07 17:44:53,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 17:44:53,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 17:44:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=986, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:44:53,199 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand 33 states. [2019-12-07 17:44:54,196 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-12-07 17:44:54,490 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-12-07 17:44:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:55,571 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2019-12-07 17:44:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:44:55,572 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 50 [2019-12-07 17:44:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:55,575 INFO L225 Difference]: With dead ends: 176 [2019-12-07 17:44:55,575 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 17:44:55,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=226, Invalid=2324, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 17:44:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 17:44:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147. [2019-12-07 17:44:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 17:44:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 179 transitions. [2019-12-07 17:44:55,588 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 179 transitions. Word has length 50 [2019-12-07 17:44:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:55,588 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 179 transitions. [2019-12-07 17:44:55,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 17:44:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 179 transitions. [2019-12-07 17:44:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:44:55,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:55,590 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:55,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:55,791 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1669979456, now seen corresponding path program 1 times [2019-12-07 17:44:55,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:55,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501816467] [2019-12-07 17:44:55,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:56,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501816467] [2019-12-07 17:44:56,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506336957] [2019-12-07 17:44:56,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:44:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:44:56,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:56,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:56,316 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 12 treesize of output 14 [2019-12-07 17:44:56,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:56,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:56,320 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 17:44:56,321 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-12-07 17:44:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:56,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:44:56,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2019-12-07 17:44:56,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044412473] [2019-12-07 17:44:56,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:56,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:56,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:56,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:44:56,349 INFO L87 Difference]: Start difference. First operand 147 states and 179 transitions. Second operand 8 states. [2019-12-07 17:44:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:56,498 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2019-12-07 17:44:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:56,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-07 17:44:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:56,500 INFO L225 Difference]: With dead ends: 150 [2019-12-07 17:44:56,500 INFO L226 Difference]: Without dead ends: 150 [2019-12-07 17:44:56,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:44:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-07 17:44:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-12-07 17:44:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:44:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2019-12-07 17:44:56,504 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 50 [2019-12-07 17:44:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:56,504 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2019-12-07 17:44:56,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2019-12-07 17:44:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:44:56,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:56,505 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:56,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:56,706 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:44:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 24805976, now seen corresponding path program 1 times [2019-12-07 17:44:56,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:56,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539536779] [2019-12-07 17:44:56,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:57,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539536779] [2019-12-07 17:44:57,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362013007] [2019-12-07 17:44:57,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:44:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:57,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-07 17:44:57,127 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:57,149 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 17:44:57,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,150 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:57,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,151 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:44:57,176 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 17:44:57,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:57,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-12-07 17:44:57,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:57,281 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 17:44:57,282 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,295 INFO L614 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2019-12-07 17:44:57,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2019-12-07 17:44:57,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:44:57,363 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:57,370 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 17:44:57,370 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2019-12-07 17:44:57,832 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:44:57,832 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 17:44:57,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:57,844 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 17:44:57,844 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:63 [2019-12-07 17:44:57,906 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 22 treesize of output 10 [2019-12-07 17:44:57,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:57,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:57,916 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 17:44:57,916 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:59 [2019-12-07 17:44:58,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:44:58,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:58,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:58,048 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 56 treesize of output 24 [2019-12-07 17:44:58,048 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 17:44:58,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:58,061 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 17:44:58,061 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:15 [2019-12-07 17:44:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:58,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:58,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 43 [2019-12-07 17:44:58,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624181778] [2019-12-07 17:44:58,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 17:44:58,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 17:44:58,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1783, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 17:44:58,184 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 44 states. [2019-12-07 17:45:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:01,182 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2019-12-07 17:45:01,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 17:45:01,182 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 52 [2019-12-07 17:45:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:01,183 INFO L225 Difference]: With dead ends: 182 [2019-12-07 17:45:01,183 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 17:45:01,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=335, Invalid=3955, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 17:45:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 17:45:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2019-12-07 17:45:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:45:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2019-12-07 17:45:01,188 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 185 transitions. Word has length 52 [2019-12-07 17:45:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:01,188 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 185 transitions. [2019-12-07 17:45:01,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 17:45:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2019-12-07 17:45:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:45:01,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:01,189 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:01,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:01,391 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:45:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:01,392 INFO L82 PathProgramCache]: Analyzing trace with hash 24805977, now seen corresponding path program 1 times [2019-12-07 17:45:01,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:01,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555765465] [2019-12-07 17:45:01,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:45:01,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555765465] [2019-12-07 17:45:01,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816464353] [2019-12-07 17:45:01,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:45:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:01,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 96 conjunts are in the unsatisfiable core [2019-12-07 17:45:01,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:01,967 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 17:45:01,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:01,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:01,972 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 17:45:01,972 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:01,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:01,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:01,977 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 17:45:02,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:02,287 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 12 treesize of output 14 [2019-12-07 17:45:02,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:02,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:02,302 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:02,303 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 17:45:02,303 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:02,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:02,310 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:02,310 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2019-12-07 17:45:02,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:02,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:02,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:02,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:02,408 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:02,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:02,421 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 17:45:02,421 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:48 [2019-12-07 17:45:03,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:03,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:03,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:03,231 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 3 case distinctions, treesize of input 118 treesize of output 79 [2019-12-07 17:45:03,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:03,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:03,233 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 17:45:03,264 INFO L614 ElimStorePlain]: treesize reduction 13, result has 84.3 percent of original size [2019-12-07 17:45:03,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:03,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:03,281 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 3 case distinctions, treesize of input 50 treesize of output 47 [2019-12-07 17:45:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:03,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:03,285 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-12-07 17:45:03,318 INFO L614 ElimStorePlain]: treesize reduction 129, result has 20.9 percent of original size [2019-12-07 17:45:03,319 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 17:45:03,319 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:128, output treesize:26 [2019-12-07 17:45:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:03,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:03,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 51 [2019-12-07 17:45:03,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267699247] [2019-12-07 17:45:03,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 17:45:03,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 17:45:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2524, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 17:45:03,449 INFO L87 Difference]: Start difference. First operand 152 states and 185 transitions. Second operand 52 states. [2019-12-07 17:45:05,253 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-12-07 17:45:05,744 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2019-12-07 17:45:06,127 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-12-07 17:45:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:07,364 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2019-12-07 17:45:07,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 17:45:07,365 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-12-07 17:45:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:07,366 INFO L225 Difference]: With dead ends: 197 [2019-12-07 17:45:07,366 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 17:45:07,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=387, Invalid=5015, Unknown=0, NotChecked=0, Total=5402 [2019-12-07 17:45:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 17:45:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 166. [2019-12-07 17:45:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 17:45:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 205 transitions. [2019-12-07 17:45:07,372 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 205 transitions. Word has length 52 [2019-12-07 17:45:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:07,373 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 205 transitions. [2019-12-07 17:45:07,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 17:45:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2019-12-07 17:45:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 17:45:07,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:07,374 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:45:07,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:07,575 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:45:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:07,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1931258174, now seen corresponding path program 1 times [2019-12-07 17:45:07,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:07,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074186632] [2019-12-07 17:45:07,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:45:07,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074186632] [2019-12-07 17:45:07,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997455905] [2019-12-07 17:45:07,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:45:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:07,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:45:07,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:07,833 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 17:45:07,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:07,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:07,835 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 17:45:07,835 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 17:45:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:45:07,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:07,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 17 [2019-12-07 17:45:07,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560897909] [2019-12-07 17:45:07,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:45:07,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:07,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:45:07,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:45:07,838 INFO L87 Difference]: Start difference. First operand 166 states and 205 transitions. Second operand 18 states. [2019-12-07 17:45:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:08,604 INFO L93 Difference]: Finished difference Result 191 states and 231 transitions. [2019-12-07 17:45:08,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:45:08,605 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-07 17:45:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:08,606 INFO L225 Difference]: With dead ends: 191 [2019-12-07 17:45:08,606 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 17:45:08,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 17:45:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 17:45:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2019-12-07 17:45:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:45:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2019-12-07 17:45:08,611 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 54 [2019-12-07 17:45:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:08,612 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2019-12-07 17:45:08,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:45:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2019-12-07 17:45:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 17:45:08,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:08,612 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:45:08,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:08,814 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:45:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1931258173, now seen corresponding path program 1 times [2019-12-07 17:45:08,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:08,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797117957] [2019-12-07 17:45:08,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:45:09,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797117957] [2019-12-07 17:45:09,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463997673] [2019-12-07 17:45:09,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:45:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:09,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:45:09,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:09,195 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 17:45:09,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:09,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,199 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 19 treesize of output 11 [2019-12-07 17:45:09,199 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:09,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,201 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 17:45:09,201 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-12-07 17:45:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:45:09,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:09,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 25 [2019-12-07 17:45:09,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683860289] [2019-12-07 17:45:09,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 17:45:09,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:09,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 17:45:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:45:09,286 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand 26 states. [2019-12-07 17:45:10,729 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-07 17:45:11,538 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 17:45:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:13,062 INFO L93 Difference]: Finished difference Result 195 states and 230 transitions. [2019-12-07 17:45:13,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 17:45:13,062 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-12-07 17:45:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:13,063 INFO L225 Difference]: With dead ends: 195 [2019-12-07 17:45:13,064 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 17:45:13,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=392, Invalid=2688, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 17:45:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 17:45:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2019-12-07 17:45:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:45:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2019-12-07 17:45:13,070 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 54 [2019-12-07 17:45:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:13,070 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 199 transitions. [2019-12-07 17:45:13,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 17:45:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 199 transitions. [2019-12-07 17:45:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:45:13,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:13,071 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:13,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:13,272 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:45:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash 261241082, now seen corresponding path program 1 times [2019-12-07 17:45:13,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:13,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962852605] [2019-12-07 17:45:13,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:45:13,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962852605] [2019-12-07 17:45:13,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:13,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:45:13,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690276805] [2019-12-07 17:45:13,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:45:13,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:13,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:45:13,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:13,338 INFO L87 Difference]: Start difference. First operand 165 states and 199 transitions. Second operand 8 states. [2019-12-07 17:45:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:13,513 INFO L93 Difference]: Finished difference Result 183 states and 225 transitions. [2019-12-07 17:45:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:45:13,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 17:45:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:13,515 INFO L225 Difference]: With dead ends: 183 [2019-12-07 17:45:13,515 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 17:45:13,515 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 17:45:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 17:45:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-12-07 17:45:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-12-07 17:45:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2019-12-07 17:45:13,519 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 55 [2019-12-07 17:45:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:13,519 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2019-12-07 17:45:13,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:45:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2019-12-07 17:45:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:45:13,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:13,519 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:13,520 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:45:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:13,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2117759309, now seen corresponding path program 3 times [2019-12-07 17:45:13,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:13,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621406389] [2019-12-07 17:45:13,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:45:13,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621406389] [2019-12-07 17:45:13,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469892068] [2019-12-07 17:45:13,615 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:45:13,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 17:45:13,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:45:13,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:45:13,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:45:13,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:13,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-12-07 17:45:13,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210555912] [2019-12-07 17:45:13,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:45:13,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:13,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:45:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:45:13,741 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand 10 states. [2019-12-07 17:45:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:13,936 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-12-07 17:45:13,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:45:13,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 17:45:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:13,936 INFO L225 Difference]: With dead ends: 116 [2019-12-07 17:45:13,937 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 17:45:13,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:45:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 17:45:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-12-07 17:45:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:45:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-12-07 17:45:13,939 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 56 [2019-12-07 17:45:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:13,940 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-12-07 17:45:13,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:45:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-12-07 17:45:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:45:13,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:13,940 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:45:14,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:14,141 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:45:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash -513230238, now seen corresponding path program 1 times [2019-12-07 17:45:14,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:14,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039955343] [2019-12-07 17:45:14,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:45:14,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039955343] [2019-12-07 17:45:14,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534496031] [2019-12-07 17:45:14,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:45:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:14,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 17:45:14,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:14,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:14,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:14,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:14,557 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 17:45:14,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-12-07 17:45:14,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 27 treesize of output 19 [2019-12-07 17:45:14,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:14,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:14,744 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 17:45:14,744 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-12-07 17:45:14,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:14,829 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 29 treesize of output 26 [2019-12-07 17:45:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:14,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 17:45:14,833 INFO L614 ElimStorePlain]: treesize reduction 13, result has 27.8 percent of original size [2019-12-07 17:45:14,834 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 17:45:14,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-12-07 17:45:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:45:14,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:14,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 33 [2019-12-07 17:45:14,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894601987] [2019-12-07 17:45:14,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 17:45:14,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:14,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 17:45:14,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1050, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:45:14,841 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 34 states. [2019-12-07 17:45:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:16,807 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-12-07 17:45:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:45:16,807 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 56 [2019-12-07 17:45:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:16,808 INFO L225 Difference]: With dead ends: 118 [2019-12-07 17:45:16,808 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 17:45:16,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=236, Invalid=2520, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 17:45:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 17:45:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2019-12-07 17:45:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:45:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-12-07 17:45:16,811 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 56 [2019-12-07 17:45:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:16,811 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-12-07 17:45:16,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 17:45:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-12-07 17:45:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:45:16,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:16,812 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:17,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:17,013 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:45:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash -513177650, now seen corresponding path program 2 times [2019-12-07 17:45:17,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:17,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907368128] [2019-12-07 17:45:17,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:45:17,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907368128] [2019-12-07 17:45:17,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619643476] [2019-12-07 17:45:17,888 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:45:17,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:45:17,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:45:17,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 109 conjunts are in the unsatisfiable core [2019-12-07 17:45:17,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:18,001 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 17:45:18,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,004 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:45:18,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:18,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:18,047 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,054 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-12-07 17:45:18,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:18,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 17:45:18,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:18,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 17:45:18,115 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,121 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2019-12-07 17:45:18,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-07 17:45:18,305 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-07 17:45:18,317 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,323 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2019-12-07 17:45:28,786 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:45:33,039 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:45:33,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:33,059 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 17:45:33,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:33,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:33,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:33,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-12-07 17:45:33,081 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:33,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:33,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:33,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-12-07 17:45:33,095 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:33,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:33,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:33,103 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:40 [2019-12-07 17:45:33,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:33,257 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2019-12-07 17:45:33,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:33,288 INFO L614 ElimStorePlain]: treesize reduction 18, result has 78.8 percent of original size [2019-12-07 17:45:33,302 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:33,302 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2019-12-07 17:45:33,302 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:33,333 INFO L614 ElimStorePlain]: treesize reduction 26, result has 70.8 percent of original size [2019-12-07 17:45:33,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:33,334 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 17:45:33,334 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:72 [2019-12-07 17:45:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:34,389 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 156 treesize of output 145 [2019-12-07 17:45:34,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:34,435 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 17:45:34,456 INFO L614 ElimStorePlain]: treesize reduction 107, result has 30.5 percent of original size [2019-12-07 17:45:34,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:34,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 52 [2019-12-07 17:45:34,469 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:34,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:34,472 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 17:45:34,473 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:156, output treesize:7 [2019-12-07 17:45:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:34,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:34,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 56 [2019-12-07 17:45:34,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921661186] [2019-12-07 17:45:34,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 17:45:34,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:34,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 17:45:34,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2940, Unknown=5, NotChecked=0, Total=3080 [2019-12-07 17:45:34,547 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 56 states. [2019-12-07 17:45:51,552 WARN L192 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-07 17:46:00,039 WARN L192 SmtUtils]: Spent 8.25 s on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2019-12-07 17:46:01,906 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2019-12-07 17:46:02,183 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-12-07 17:46:02,481 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-12-07 17:46:03,020 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2019-12-07 17:46:03,332 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-12-07 17:46:03,573 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-07 17:46:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:04,355 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-12-07 17:46:04,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 17:46:04,356 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-12-07 17:46:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:04,356 INFO L225 Difference]: With dead ends: 109 [2019-12-07 17:46:04,357 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 17:46:04,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=358, Invalid=5954, Unknown=8, NotChecked=0, Total=6320 [2019-12-07 17:46:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 17:46:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-12-07 17:46:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:46:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-12-07 17:46:04,360 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 56 [2019-12-07 17:46:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:04,361 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-12-07 17:46:04,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 17:46:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-12-07 17:46:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:46:04,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:04,361 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:46:04,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:46:04,562 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:46:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1944577884, now seen corresponding path program 1 times [2019-12-07 17:46:04,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:46:04,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949938446] [2019-12-07 17:46:04,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:46:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:46:04,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949938446] [2019-12-07 17:46:04,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262799784] [2019-12-07 17:46:04,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:46:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:04,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:46:04,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:46:04,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:46:04,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-12-07 17:46:04,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582834514] [2019-12-07 17:46:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:46:04,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:46:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:46:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:46:04,746 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 8 states. [2019-12-07 17:46:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:04,866 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-12-07 17:46:04,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:46:04,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-07 17:46:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:04,867 INFO L225 Difference]: With dead ends: 111 [2019-12-07 17:46:04,867 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 17:46:04,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:46:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 17:46:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 17:46:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:46:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-12-07 17:46:04,869 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 57 [2019-12-07 17:46:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:04,869 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-12-07 17:46:04,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:46:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-12-07 17:46:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:46:04,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:04,870 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:46:05,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:46:05,071 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:46:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 156639336, now seen corresponding path program 1 times [2019-12-07 17:46:05,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:46:05,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092798764] [2019-12-07 17:46:05,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:46:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:46:05,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092798764] [2019-12-07 17:46:05,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640643981] [2019-12-07 17:46:05,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:46:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:05,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 17:46:05,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:05,657 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 17:46:05,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:05,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:05,660 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 17:46:05,660 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 17:46:05,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 17:46:05,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:05,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:05,861 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:46:05,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-12-07 17:46:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:46:05,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:46:05,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 36 [2019-12-07 17:46:05,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906646235] [2019-12-07 17:46:05,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 17:46:05,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:46:05,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 17:46:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:46:05,898 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 36 states. [2019-12-07 17:46:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:07,221 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2019-12-07 17:46:07,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 17:46:07,221 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 58 [2019-12-07 17:46:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:07,222 INFO L225 Difference]: With dead ends: 109 [2019-12-07 17:46:07,222 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 17:46:07,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=2710, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 17:46:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 17:46:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-12-07 17:46:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:46:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-12-07 17:46:07,225 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 58 [2019-12-07 17:46:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:07,226 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-12-07 17:46:07,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 17:46:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-12-07 17:46:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 17:46:07,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:07,226 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:46:07,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:46:07,427 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:46:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1461090775, now seen corresponding path program 1 times [2019-12-07 17:46:07,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:46:07,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765554132] [2019-12-07 17:46:07,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:46:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:46:07,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765554132] [2019-12-07 17:46:07,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002917720] [2019-12-07 17:46:07,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:46:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:07,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:46:07,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:07,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:07,667 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 28 [2019-12-07 17:46:07,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:07,679 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 17:46:07,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:07,680 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 17:46:07,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:18 [2019-12-07 17:46:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 17:46:07,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:46:07,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-12-07 17:46:07,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162989703] [2019-12-07 17:46:07,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:46:07,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:46:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:46:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:46:07,772 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 19 states. [2019-12-07 17:46:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:08,447 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-12-07 17:46:08,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:46:08,447 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2019-12-07 17:46:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:08,448 INFO L225 Difference]: With dead ends: 135 [2019-12-07 17:46:08,448 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 17:46:08,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:46:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 17:46:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2019-12-07 17:46:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 17:46:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-12-07 17:46:08,451 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 64 [2019-12-07 17:46:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:08,451 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-12-07 17:46:08,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:46:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-12-07 17:46:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:46:08,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:08,452 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] [2019-12-07 17:46:08,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:46:08,653 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:46:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1950826281, now seen corresponding path program 1 times [2019-12-07 17:46:08,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:46:08,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302080371] [2019-12-07 17:46:08,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:46:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:46:09,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302080371] [2019-12-07 17:46:09,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722710294] [2019-12-07 17:46:09,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:46:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:09,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 96 conjunts are in the unsatisfiable core [2019-12-07 17:46:09,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:09,802 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 17:46:09,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:09,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:09,810 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 17:46:09,810 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:09,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:09,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:46:09,816 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-12-07 17:46:10,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:46:10,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:10,059 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:10,059 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 17:46:10,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-12-07 17:46:10,453 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 9 treesize of output 3 [2019-12-07 17:46:10,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:10,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:10,469 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_8|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_10|]} [2019-12-07 17:46:10,472 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 17:46:10,472 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:10,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:10,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:46:10,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:10,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 18 [2019-12-07 17:46:10,486 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 17:46:10,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:10,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:10,495 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:64, output treesize:15 [2019-12-07 17:46:14,814 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 17:46:16,941 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 17:46:20,303 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 17:46:20,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:20,316 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 30 treesize of output 28 [2019-12-07 17:46:20,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:20,360 INFO L614 ElimStorePlain]: treesize reduction 3, result has 96.6 percent of original size [2019-12-07 17:46:20,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:46:20,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-12-07 17:46:20,364 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:20,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:20,386 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_52|], 12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_52|]} [2019-12-07 17:46:20,389 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 17:46:20,389 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:20,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:20,408 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:46:20,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:20,448 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 154 [2019-12-07 17:46:20,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:46:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:46:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:46:20,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:46:20,453 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 17:46:20,520 INFO L614 ElimStorePlain]: treesize reduction 219, result has 28.2 percent of original size [2019-12-07 17:46:20,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:20,521 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:111, output treesize:86 [2019-12-07 17:46:20,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:20,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:21,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:21,327 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2019-12-07 17:46:21,327 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:21,337 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 17:46:21,337 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 17:46:21,337 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:11 [2019-12-07 17:46:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:46:21,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:46:21,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 61 [2019-12-07 17:46:21,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544194370] [2019-12-07 17:46:21,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-12-07 17:46:21,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:46:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-12-07 17:46:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=3628, Unknown=2, NotChecked=0, Total=3782 [2019-12-07 17:46:21,440 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 62 states. [2019-12-07 17:46:24,132 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-12-07 17:46:24,364 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2019-12-07 17:46:24,628 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-12-07 17:46:24,912 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-12-07 17:46:29,189 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-12-07 17:46:31,371 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 17:46:33,499 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 17:46:35,553 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 17:46:36,331 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-12-07 17:46:36,612 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2019-12-07 17:46:36,893 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 93 [2019-12-07 17:46:37,164 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-12-07 17:46:37,501 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2019-12-07 17:46:38,055 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 100 [2019-12-07 17:46:39,311 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-12-07 17:46:39,607 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-12-07 17:46:39,916 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2019-12-07 17:46:40,136 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-12-07 17:46:40,843 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-12-07 17:46:41,391 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 17:46:41,781 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 17:46:42,169 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 17:46:42,861 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-07 17:46:43,233 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-07 17:46:43,828 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-12-07 17:46:44,383 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-12-07 17:46:45,012 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-12-07 17:46:45,550 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-12-07 17:46:45,754 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-12-07 17:46:45,946 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-12-07 17:46:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:46,282 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-12-07 17:46:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-07 17:46:46,283 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 65 [2019-12-07 17:46:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:46,283 INFO L225 Difference]: With dead ends: 143 [2019-12-07 17:46:46,284 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 17:46:46,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3141 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=1206, Invalid=14291, Unknown=3, NotChecked=0, Total=15500 [2019-12-07 17:46:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 17:46:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 100. [2019-12-07 17:46:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 17:46:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-12-07 17:46:46,288 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 65 [2019-12-07 17:46:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:46,289 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-12-07 17:46:46,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-12-07 17:46:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-12-07 17:46:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:46:46,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:46,289 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] [2019-12-07 17:46:46,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:46:46,490 INFO L410 AbstractCegarLoop]: === Iteration 32 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:46:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1950826282, now seen corresponding path program 1 times [2019-12-07 17:46:46,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:46:46,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175962689] [2019-12-07 17:46:46,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:46:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:46:47,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175962689] [2019-12-07 17:46:47,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904119238] [2019-12-07 17:46:47,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:46:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:47,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 17:46:47,152 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:47,179 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 17:46:47,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:47,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:47,182 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:46:47,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:46:47,425 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 19 treesize of output 11 [2019-12-07 17:46:47,425 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 17:46:47,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:47,429 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 17:46:47,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2019-12-07 17:46:47,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:47,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 73 [2019-12-07 17:46:47,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:47,810 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:47,844 INFO L614 ElimStorePlain]: treesize reduction 22, result has 80.0 percent of original size [2019-12-07 17:46:47,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:47,845 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 17:46:47,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:88 [2019-12-07 17:46:47,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:48,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:48,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:48,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:48,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:48,336 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 65 treesize of output 59 [2019-12-07 17:46:48,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:48,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:48,348 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 68 treesize of output 78 [2019-12-07 17:46:48,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:48,349 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:48,372 INFO L614 ElimStorePlain]: treesize reduction 22, result has 77.8 percent of original size [2019-12-07 17:46:48,372 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 17:46:48,372 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:159, output treesize:77 [2019-12-07 17:46:49,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:49,005 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 67 treesize of output 54 [2019-12-07 17:46:49,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:49,052 INFO L614 ElimStorePlain]: treesize reduction 14, result has 77.0 percent of original size [2019-12-07 17:46:49,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:46:49,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2019-12-07 17:46:49,059 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:49,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:49,069 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 17:46:49,069 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:18 [2019-12-07 17:46:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:46:49,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:46:49,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 47 [2019-12-07 17:46:49,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224214538] [2019-12-07 17:46:49,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 17:46:49,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:46:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 17:46:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2147, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 17:46:49,243 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 48 states. [2019-12-07 17:46:54,519 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 71 [2019-12-07 17:46:54,865 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 73 [2019-12-07 17:46:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:59,404 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2019-12-07 17:46:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 17:46:59,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 65 [2019-12-07 17:46:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:59,405 INFO L225 Difference]: With dead ends: 161 [2019-12-07 17:46:59,405 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 17:46:59,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=708, Invalid=7122, Unknown=2, NotChecked=0, Total=7832 [2019-12-07 17:46:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 17:46:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2019-12-07 17:46:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 17:46:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2019-12-07 17:46:59,409 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 65 [2019-12-07 17:46:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:59,409 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2019-12-07 17:46:59,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 17:46:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2019-12-07 17:46:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:46:59,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:59,409 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:46:59,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:46:59,611 INFO L410 AbstractCegarLoop]: === Iteration 33 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:46:59,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1928027338, now seen corresponding path program 1 times [2019-12-07 17:46:59,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:46:59,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389015321] [2019-12-07 17:46:59,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:46:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:46:59,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389015321] [2019-12-07 17:46:59,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376505063] [2019-12-07 17:46:59,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:46:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:59,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 17:47:00,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:47:00,084 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 9 treesize of output 5 [2019-12-07 17:47:00,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:00,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:00,087 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 17:47:00,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2019-12-07 17:47:00,882 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_remove_last_~snd_to_last~0.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_remove_last_#in~head.base|) |c_sll_remove_last_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) (+ sll_remove_last_~snd_to_last~0.offset 4) 0))))) is different from true [2019-12-07 17:47:00,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:00,897 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 31 treesize of output 53 [2019-12-07 17:47:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:47:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:00,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:47:00,925 INFO L614 ElimStorePlain]: treesize reduction 113, result has 20.4 percent of original size [2019-12-07 17:47:00,925 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 17:47:00,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 17:47:01,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:01,048 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 30 treesize of output 29 [2019-12-07 17:47:01,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:47:01,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 17:47:01,060 INFO L614 ElimStorePlain]: treesize reduction 37, result has 19.6 percent of original size [2019-12-07 17:47:01,060 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 17:47:01,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2019-12-07 17:47:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:47:01,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:47:01,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 31 [2019-12-07 17:47:01,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464869300] [2019-12-07 17:47:01,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 17:47:01,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:01,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 17:47:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=839, Unknown=1, NotChecked=58, Total=992 [2019-12-07 17:47:01,070 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand 32 states. [2019-12-07 17:47:07,989 WARN L192 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-12-07 17:47:20,027 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-12-07 17:47:35,783 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-07 17:47:47,374 WARN L192 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-12-07 17:47:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:54,841 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2019-12-07 17:47:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 17:47:54,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-12-07 17:47:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:54,842 INFO L225 Difference]: With dead ends: 159 [2019-12-07 17:47:54,842 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:47:54,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=519, Invalid=3445, Unknown=72, NotChecked=124, Total=4160 [2019-12-07 17:47:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:47:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-12-07 17:47:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 17:47:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2019-12-07 17:47:54,845 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 69 [2019-12-07 17:47:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:54,845 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2019-12-07 17:47:54,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 17:47:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2019-12-07 17:47:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 17:47:54,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:54,846 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:47:55,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:47:55,046 INFO L410 AbstractCegarLoop]: === Iteration 34 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:47:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2117511897, now seen corresponding path program 1 times [2019-12-07 17:47:55,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:55,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309352221] [2019-12-07 17:47:55,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:47:55,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309352221] [2019-12-07 17:47:55,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035652423] [2019-12-07 17:47:55,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:47:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:55,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-07 17:47:55,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:47:55,582 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 17:47:55,582 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:55,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:55,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:47:55,585 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:47:55,875 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 17:47:55,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:55,880 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:55,882 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 19 treesize of output 11 [2019-12-07 17:47:55,882 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 17:47:55,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:55,887 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 17:47:55,887 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:12 [2019-12-07 17:47:56,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:47:56,228 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 58 treesize of output 48 [2019-12-07 17:47:56,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:56,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:56,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:47:56,244 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 17:47:56,245 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:56,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:56,256 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 17:47:56,256 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2019-12-07 17:47:56,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:47:56,752 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 17:47:56,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:56,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:56,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:47:56,777 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:112, output treesize:95 [2019-12-07 17:47:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:47:56,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:47:56,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 49 [2019-12-07 17:47:56,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27612378] [2019-12-07 17:47:56,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 17:47:56,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 17:47:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2226, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 17:47:56,887 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 49 states. [2019-12-07 17:48:01,276 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-12-07 17:48:01,616 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-12-07 17:48:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:02,318 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-12-07 17:48:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 17:48:02,318 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 71 [2019-12-07 17:48:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:02,320 INFO L225 Difference]: With dead ends: 120 [2019-12-07 17:48:02,320 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 17:48:02,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1898 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=868, Invalid=8444, Unknown=0, NotChecked=0, Total=9312 [2019-12-07 17:48:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 17:48:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2019-12-07 17:48:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:48:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-12-07 17:48:02,325 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 71 [2019-12-07 17:48:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:02,326 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-12-07 17:48:02,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 17:48:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-12-07 17:48:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 17:48:02,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:02,327 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:48:02,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:02,528 INFO L410 AbstractCegarLoop]: === Iteration 35 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:48:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash 909184943, now seen corresponding path program 1 times [2019-12-07 17:48:02,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:02,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41322318] [2019-12-07 17:48:02,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 17:48:02,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41322318] [2019-12-07 17:48:02,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:02,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:48:02,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320540575] [2019-12-07 17:48:02,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:48:02,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:48:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:48:02,646 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 9 states. [2019-12-07 17:48:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:02,927 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-12-07 17:48:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:48:02,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-12-07 17:48:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:02,928 INFO L225 Difference]: With dead ends: 103 [2019-12-07 17:48:02,928 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 17:48:02,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:48:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 17:48:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-12-07 17:48:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 17:48:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-12-07 17:48:02,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 78 [2019-12-07 17:48:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:02,931 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-12-07 17:48:02,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:48:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-12-07 17:48:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 17:48:02,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:02,932 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:48:02,932 INFO L410 AbstractCegarLoop]: === Iteration 36 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:48:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash 909185008, now seen corresponding path program 1 times [2019-12-07 17:48:02,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:02,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129361643] [2019-12-07 17:48:02,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:48:04,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129361643] [2019-12-07 17:48:04,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776976266] [2019-12-07 17:48:04,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/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 17:48:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:04,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 113 conjunts are in the unsatisfiable core [2019-12-07 17:48:04,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:04,882 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 17:48:04,882 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:04,886 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:04,886 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 17:48:04,886 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 17:48:04,960 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 17:48:04,974 INFO L614 ElimStorePlain]: treesize reduction 21, result has 51.2 percent of original size [2019-12-07 17:48:04,977 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 24 treesize of output 20 [2019-12-07 17:48:04,977 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:04,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:04,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:48:04,983 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-12-07 17:48:04,986 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 17:48:04,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:04,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:04,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:48:04,993 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 17:48:05,159 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 17:48:05,185 INFO L614 ElimStorePlain]: treesize reduction 21, result has 69.1 percent of original size [2019-12-07 17:48:05,185 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 17:48:05,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:47 [2019-12-07 17:48:05,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:48:05,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:05,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:05,380 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 1 xjuncts. [2019-12-07 17:48:05,380 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:65 [2019-12-07 17:48:06,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:06,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:06,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:06,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:06,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:06,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 89 [2019-12-07 17:48:06,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:06,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:06,203 INFO L614 ElimStorePlain]: treesize reduction 12, result has 86.5 percent of original size [2019-12-07 17:48:06,203 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_14|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_22|]} [2019-12-07 17:48:06,206 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 17:48:06,206 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:06,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:06,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:06,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:06,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2019-12-07 17:48:06,224 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 17:48:06,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:06,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:48:06,235 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:112, output treesize:15 [2019-12-07 17:48:08,589 WARN L192 SmtUtils]: Spent 852.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 17:48:09,678 WARN L192 SmtUtils]: Spent 959.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 17:48:09,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:09,690 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 30 treesize of output 28 [2019-12-07 17:48:09,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:09,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:09,724 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_15|], 12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_68|]} [2019-12-07 17:48:09,727 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 48 treesize of output 36 [2019-12-07 17:48:09,728 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 17:48:09,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:09,759 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:48:09,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:09,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:09,789 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 176 [2019-12-07 17:48:09,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:48:09,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:09,823 INFO L534 ElimStorePlain]: Start of recursive call 4: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 7 xjuncts. [2019-12-07 17:48:12,176 WARN L192 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 251 DAG size of output: 80 [2019-12-07 17:48:12,176 INFO L614 ElimStorePlain]: treesize reduction 6356, result has 6.1 percent of original size [2019-12-07 17:48:12,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:48:12,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-12-07 17:48:12,178 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:180, output treesize:408 [2019-12-07 17:48:12,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:48:12,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:48:13,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:48:16,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:16,532 INFO L430 ElimStorePlain]: Different costs {2=[v_prenex_15], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_69|]} [2019-12-07 17:48:16,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:16,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:16,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 58 [2019-12-07 17:48:16,538 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 17:48:16,679 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-12-07 17:48:16,680 INFO L614 ElimStorePlain]: treesize reduction 52, result has 80.2 percent of original size [2019-12-07 17:48:16,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:16,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:16,691 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 128 treesize of output 91 [2019-12-07 17:48:16,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:16,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:48:16,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:48:16,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:16,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:48:16,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:48:16,694 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:48:16,809 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-12-07 17:48:16,810 INFO L614 ElimStorePlain]: treesize reduction 14, result has 91.6 percent of original size [2019-12-07 17:48:16,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:16,811 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-12-07 17:48:16,811 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:299, output treesize:188 [2019-12-07 17:48:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:48:17,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:17,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 39] total 67 [2019-12-07 17:48:17,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458824703] [2019-12-07 17:48:17,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-12-07 17:48:17,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-12-07 17:48:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4344, Unknown=2, NotChecked=0, Total=4556 [2019-12-07 17:48:17,351 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 68 states. [2019-12-07 17:48:21,381 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-12-07 17:48:26,948 WARN L192 SmtUtils]: Spent 956.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 17:48:28,898 WARN L192 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-07 17:48:30,951 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-12-07 17:48:31,646 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-12-07 17:48:31,980 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-12-07 17:48:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:33,101 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-12-07 17:48:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 17:48:33,101 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 78 [2019-12-07 17:48:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:33,102 INFO L225 Difference]: With dead ends: 123 [2019-12-07 17:48:33,102 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 17:48:33,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=697, Invalid=10429, Unknown=4, NotChecked=0, Total=11130 [2019-12-07 17:48:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 17:48:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2019-12-07 17:48:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:48:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-12-07 17:48:33,106 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 78 [2019-12-07 17:48:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:33,106 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-12-07 17:48:33,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-12-07 17:48:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-12-07 17:48:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 17:48:33,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:33,107 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-12-07 17:48:33,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:48:33,308 INFO L410 AbstractCegarLoop]: === Iteration 37 === [sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr15REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_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 17:48:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1875770763, now seen corresponding path program 1 times [2019-12-07 17:48:33,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:33,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690939071] [2019-12-07 17:48:33,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 17:48:33,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690939071] [2019-12-07 17:48:33,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:33,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:48:33,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825912259] [2019-12-07 17:48:33,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:48:33,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:48:33,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:48:33,381 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 9 states. [2019-12-07 17:48:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:33,504 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-12-07 17:48:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:48:33,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-12-07 17:48:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:33,505 INFO L225 Difference]: With dead ends: 68 [2019-12-07 17:48:33,505 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:48:33,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:48:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:48:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:48:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:48:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:48:33,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-12-07 17:48:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:33,506 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:48:33,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:48:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:48:33,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:48:33,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:48:33 BoogieIcfgContainer [2019-12-07 17:48:33,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:48:33,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:48:33,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:48:33,510 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:48:33,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:41" (3/4) ... [2019-12-07 17:48:33,512 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:48:33,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 17:48:33,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 17:48:33,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_last [2019-12-07 17:48:33,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 17:48:33,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 17:48:33,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-12-07 17:48:33,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 17:48:33,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 17:48:33,522 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 17:48:33,522 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 17:48:33,522 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:48:33,522 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:48:33,556 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c28905bf-9940-4640-9854-603959d8d6aa/bin/uautomizer/witness.graphml [2019-12-07 17:48:33,556 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:48:33,557 INFO L168 Benchmark]: Toolchain (without parser) took 232844.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -82.3 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:33,558 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:48:33,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:33,558 INFO L168 Benchmark]: Boogie Preprocessor took 39.75 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 17:48:33,558 INFO L168 Benchmark]: RCFGBuilder took 348.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.2 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:33,558 INFO L168 Benchmark]: TraceAbstraction took 232052.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 991.9 MB in the beginning and 1.0 GB in the end (delta: -38.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:33,559 INFO L168 Benchmark]: Witness Printer took 46.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:33,560 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.75 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 348.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.2 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 232052.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 991.9 MB in the beginning and 1.0 GB in the end (delta: -38.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Witness Printer took 46.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: 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: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free 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: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: 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: 582]: 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: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 582]: 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: 582]: 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: 583]: 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: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 596]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: 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 32 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 98 locations, 32 error locations. Result: SAFE, OverallTime: 232.0s, OverallIterations: 37, TraceHistogramMax: 3, AutomataDifference: 165.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1718 SDtfs, 7536 SDslu, 11582 SDs, 0 SdLazy, 36327 SolverSat, 1411 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 38.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 1111 SyntacticMatches, 38 SemanticMatches, 1307 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14664 ImplicationChecksByTransitivity, 174.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=24, 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, 37 MinimizatonAttempts, 595 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 59.6s InterpolantComputationTime, 2899 NumberOfCodeBlocks, 2899 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2842 ConstructedInterpolants, 237 QuantifiedInterpolants, 2030651 SizeOfPredicates, 293 NumberOfNonLiveVariables, 6108 ConjunctsInSsa, 975 ConjunctsInUnsatCore, 57 InterpolantComputations, 18 PerfectInterpolantSequences, 606/963 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...