./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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 b7a6c79ad5924d178a48cf0cbbdc1138caa9a120 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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 b7a6c79ad5924d178a48cf0cbbdc1138caa9a120 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:31:01,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:31:01,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:31:01,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:31:01,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:31:01,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:31:01,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:31:01,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:31:01,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:31:01,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:31:01,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:31:01,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:31:01,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:31:01,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:31:01,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:31:01,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:31:01,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:31:01,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:31:01,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:31:01,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:31:01,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:31:01,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:31:01,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:31:01,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:31:01,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:31:01,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:31:01,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:31:01,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:31:01,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:31:01,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:31:01,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:31:01,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:31:01,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:31:01,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:31:01,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:31:01,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:31:01,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:31:01,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:31:01,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:31:01,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:31:01,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:31:01,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:31:01,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:31:01,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:31:01,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:31:01,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:31:01,487 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:31:01,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:31:01,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:31:01,488 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:31:01,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:31:01,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:31:01,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:31:01,489 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:31:01,489 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:31:01,490 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:31:01,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:31:01,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:31:01,490 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:31:01,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:31:01,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:31:01,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:31:01,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:31:01,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:31:01,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:31:01,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:31:01,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:31:01,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:31:01,494 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_5b6cdff0-af23-4a2d-bed1-8bd366746356/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 -> b7a6c79ad5924d178a48cf0cbbdc1138caa9a120 [2019-11-15 21:31:01,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:31:01,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:31:01,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:31:01,547 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:31:01,548 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:31:01,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2019-11-15 21:31:01,611 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/c951ad39c/7b4921813f204f379bc0bc914bab3af8/FLAG1c6a8da22 [2019-11-15 21:31:02,294 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:31:02,295 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2019-11-15 21:31:02,319 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/c951ad39c/7b4921813f204f379bc0bc914bab3af8/FLAG1c6a8da22 [2019-11-15 21:31:02,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/c951ad39c/7b4921813f204f379bc0bc914bab3af8 [2019-11-15 21:31:02,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:31:02,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:31:02,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:31:02,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:31:02,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:31:02,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:31:02" (1/1) ... [2019-11-15 21:31:02,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f7db0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:02, skipping insertion in model container [2019-11-15 21:31:02,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:31:02" (1/1) ... [2019-11-15 21:31:02,490 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:31:02,534 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:31:03,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:31:03,053 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:31:03,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:31:03,254 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:31:03,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03 WrapperNode [2019-11-15 21:31:03,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:31:03,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:31:03,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:31:03,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:31:03,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... [2019-11-15 21:31:03,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... [2019-11-15 21:31:03,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... [2019-11-15 21:31:03,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... [2019-11-15 21:31:03,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... [2019-11-15 21:31:03,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... [2019-11-15 21:31:03,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... [2019-11-15 21:31:03,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:31:03,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:31:03,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:31:03,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:31:03,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:31:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:31:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:31:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:31:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:31:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:31:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-15 21:31:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-11-15 21:31:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2019-11-15 21:31:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:31:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:31:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:31:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:31:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:31:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:31:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:31:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:31:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:31:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:31:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:31:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:31:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:31:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:31:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:31:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:31:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:31:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:31:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:31:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:31:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:31:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:31:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:31:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:31:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:31:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:31:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:31:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:31:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:31:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:31:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:31:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:31:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:31:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:31:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:31:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:31:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:31:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:31:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:31:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:31:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:31:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:31:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:31:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:31:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:31:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:31:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:31:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:31:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:31:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:31:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:31:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:31:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:31:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:31:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:31:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:31:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:31:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:31:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:31:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:31:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:31:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:31:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:31:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:31:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:31:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:31:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:31:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:31:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:31:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:31:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:31:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:31:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:31:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:31:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:31:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:31:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:31:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:31:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:31:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:31:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:31:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:31:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:31:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:31:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:31:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:31:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:31:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:31:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:31:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:31:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:31:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:31:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:31:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:31:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:31:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:31:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:31:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:31:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:31:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:31:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:31:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:31:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:31:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:31:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:31:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:31:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:31:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:31:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:31:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:31:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:31:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:31:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-15 21:31:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-11-15 21:31:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:31:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:31:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2019-11-15 21:31:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:31:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:31:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:31:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:31:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:31:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:31:04,093 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:31:04,665 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:31:04,665 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:31:04,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:31:04 BoogieIcfgContainer [2019-11-15 21:31:04,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:31:04,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:31:04,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:31:04,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:31:04,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:31:02" (1/3) ... [2019-11-15 21:31:04,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14dbd23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:31:04, skipping insertion in model container [2019-11-15 21:31:04,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:03" (2/3) ... [2019-11-15 21:31:04,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14dbd23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:31:04, skipping insertion in model container [2019-11-15 21:31:04,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:31:04" (3/3) ... [2019-11-15 21:31:04,675 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2019-11-15 21:31:04,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:31:04,692 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 60 error locations. [2019-11-15 21:31:04,703 INFO L249 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2019-11-15 21:31:04,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:31:04,723 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:31:04,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:31:04,724 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:31:04,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:31:04,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:31:04,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:31:04,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:31:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-15 21:31:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:31:04,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:04,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:04,760 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash -485580583, now seen corresponding path program 1 times [2019-11-15 21:31:04,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:04,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63342478] [2019-11-15 21:31:04,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:04,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:04,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:04,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63342478] [2019-11-15 21:31:04,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:04,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:04,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286793265] [2019-11-15 21:31:05,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:31:05,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:05,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:31:05,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:31:05,027 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-11-15 21:31:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:05,771 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2019-11-15 21:31:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:31:05,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 21:31:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:05,794 INFO L225 Difference]: With dead ends: 166 [2019-11-15 21:31:05,795 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 21:31:05,803 INFO L600 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-11-15 21:31:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 21:31:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 21:31:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 21:31:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2019-11-15 21:31:05,903 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 11 [2019-11-15 21:31:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:05,904 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2019-11-15 21:31:05,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:31:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2019-11-15 21:31:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:31:05,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:05,906 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:05,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:05,908 INFO L82 PathProgramCache]: Analyzing trace with hash -485580582, now seen corresponding path program 1 times [2019-11-15 21:31:05,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:05,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203210934] [2019-11-15 21:31:05,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:05,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:05,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:06,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203210934] [2019-11-15 21:31:06,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:06,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:06,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449326668] [2019-11-15 21:31:06,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:31:06,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:06,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:31:06,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:31:06,044 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 4 states. [2019-11-15 21:31:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:06,554 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2019-11-15 21:31:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:31:06,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 21:31:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:06,557 INFO L225 Difference]: With dead ends: 155 [2019-11-15 21:31:06,557 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 21:31:06,558 INFO L600 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-11-15 21:31:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 21:31:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 138. [2019-11-15 21:31:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 21:31:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-15 21:31:06,583 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 11 [2019-11-15 21:31:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:06,584 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-15 21:31:06,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:31:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-15 21:31:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:31:06,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:06,586 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:06,587 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2029120930, now seen corresponding path program 1 times [2019-11-15 21:31:06,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:06,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379081330] [2019-11-15 21:31:06,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:06,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:06,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:06,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379081330] [2019-11-15 21:31:06,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:06,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:31:06,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673791502] [2019-11-15 21:31:06,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:31:06,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:31:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:31:06,741 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 4 states. [2019-11-15 21:31:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:07,123 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2019-11-15 21:31:07,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:31:07,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 21:31:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:07,126 INFO L225 Difference]: With dead ends: 161 [2019-11-15 21:31:07,126 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:31:07,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:31:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:31:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2019-11-15 21:31:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 21:31:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2019-11-15 21:31:07,138 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 15 [2019-11-15 21:31:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:07,139 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2019-11-15 21:31:07,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:31:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2019-11-15 21:31:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:31:07,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:07,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:07,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1015235332, now seen corresponding path program 1 times [2019-11-15 21:31:07,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:07,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731391011] [2019-11-15 21:31:07,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:07,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:07,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:07,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731391011] [2019-11-15 21:31:07,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:07,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:31:07,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96425794] [2019-11-15 21:31:07,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:31:07,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:07,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:31:07,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:31:07,269 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 5 states. [2019-11-15 21:31:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:07,771 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2019-11-15 21:31:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:31:07,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 21:31:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:07,774 INFO L225 Difference]: With dead ends: 157 [2019-11-15 21:31:07,774 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 21:31:07,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:31:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 21:31:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-15 21:31:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 21:31:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2019-11-15 21:31:07,794 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 19 [2019-11-15 21:31:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:07,795 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2019-11-15 21:31:07,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:31:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2019-11-15 21:31:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:31:07,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:07,796 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:07,797 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:07,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1015235331, now seen corresponding path program 1 times [2019-11-15 21:31:07,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:07,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913909288] [2019-11-15 21:31:07,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:07,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:07,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:07,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913909288] [2019-11-15 21:31:07,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:07,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:31:07,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609211364] [2019-11-15 21:31:07,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:31:07,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:31:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:31:07,963 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 7 states. [2019-11-15 21:31:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:08,431 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2019-11-15 21:31:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:31:08,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-15 21:31:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:08,433 INFO L225 Difference]: With dead ends: 158 [2019-11-15 21:31:08,433 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 21:31:08,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:31:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 21:31:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-15 21:31:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 21:31:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2019-11-15 21:31:08,450 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2019-11-15 21:31:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:08,451 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2019-11-15 21:31:08,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:31:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2019-11-15 21:31:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:31:08,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:08,452 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:08,453 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:08,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash 587949125, now seen corresponding path program 1 times [2019-11-15 21:31:08,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:08,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181936672] [2019-11-15 21:31:08,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:08,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:08,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:08,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181936672] [2019-11-15 21:31:08,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714980219] [2019-11-15 21:31:08,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:08,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:31:08,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:08,923 INFO L375 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-11-15 21:31:08,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:08,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:08,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:08,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:31:09,008 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:09,008 INFO L375 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-11-15 21:31:09,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:09,033 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 21:31:09,034 INFO L496 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-11-15 21:31:09,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 21:31:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:09,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:31:09,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 21:31:09,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103782664] [2019-11-15 21:31:09,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:31:09,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:31:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:31:09,070 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 8 states. [2019-11-15 21:31:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:09,689 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-11-15 21:31:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:31:09,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 21:31:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:09,692 INFO L225 Difference]: With dead ends: 153 [2019-11-15 21:31:09,692 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 21:31:09,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:31:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 21:31:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2019-11-15 21:31:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 21:31:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2019-11-15 21:31:09,700 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 22 [2019-11-15 21:31:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:09,700 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2019-11-15 21:31:09,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:31:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2019-11-15 21:31:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:31:09,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:09,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:09,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:09,908 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:09,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1692351644, now seen corresponding path program 1 times [2019-11-15 21:31:09,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:09,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347598266] [2019-11-15 21:31:09,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:09,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:09,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:10,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347598266] [2019-11-15 21:31:10,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222929266] [2019-11-15 21:31:10,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:10,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:31:10,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:10,276 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:31:10,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 21:31:10,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676962375] [2019-11-15 21:31:10,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:31:10,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:10,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:31:10,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:31:10,278 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 9 states. [2019-11-15 21:31:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:10,774 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-11-15 21:31:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:31:10,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-15 21:31:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:10,776 INFO L225 Difference]: With dead ends: 164 [2019-11-15 21:31:10,776 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:31:10,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:31:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:31:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 141. [2019-11-15 21:31:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 21:31:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2019-11-15 21:31:10,783 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 26 [2019-11-15 21:31:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:10,784 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2019-11-15 21:31:10,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:31:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2019-11-15 21:31:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:31:10,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:10,785 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:10,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:10,989 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:10,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1247605987, now seen corresponding path program 2 times [2019-11-15 21:31:10,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:10,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775133010] [2019-11-15 21:31:10,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:10,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:10,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:11,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775133010] [2019-11-15 21:31:11,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101738387] [2019-11-15 21:31:11,137 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:11,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 21:31:11,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:31:11,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:31:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:11,356 INFO L375 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-11-15 21:31:11,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:11,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:11,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:11,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:31:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:31:11,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:31:11,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-15 21:31:11,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616659397] [2019-11-15 21:31:11,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:11,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:11,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:31:11,386 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 3 states. [2019-11-15 21:31:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:11,510 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-11-15 21:31:11,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:11,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 21:31:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:11,512 INFO L225 Difference]: With dead ends: 138 [2019-11-15 21:31:11,513 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 21:31:11,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:31:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 21:31:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-15 21:31:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 21:31:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-15 21:31:11,521 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 33 [2019-11-15 21:31:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:11,523 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-15 21:31:11,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-15 21:31:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:31:11,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:11,531 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:11,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:11,745 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1459571103, now seen corresponding path program 1 times [2019-11-15 21:31:11,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:11,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434153108] [2019-11-15 21:31:11,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:11,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:11,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:11,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434153108] [2019-11-15 21:31:11,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540742866] [2019-11-15 21:31:11,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:12,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:31:12,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:12,160 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:31:12,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 21:31:12,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428839387] [2019-11-15 21:31:12,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:31:12,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:12,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:31:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:31:12,162 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 6 states. [2019-11-15 21:31:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:12,703 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2019-11-15 21:31:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:31:12,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-15 21:31:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:12,706 INFO L225 Difference]: With dead ends: 151 [2019-11-15 21:31:12,706 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 21:31:12,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 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-11-15 21:31:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 21:31:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 138. [2019-11-15 21:31:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 21:31:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2019-11-15 21:31:12,712 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 40 [2019-11-15 21:31:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:12,712 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2019-11-15 21:31:12,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:31:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2019-11-15 21:31:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 21:31:12,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:12,721 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:12,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:12,922 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1767482702, now seen corresponding path program 1 times [2019-11-15 21:31:12,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:12,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975109421] [2019-11-15 21:31:12,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:12,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:12,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:13,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975109421] [2019-11-15 21:31:13,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034494907] [2019-11-15 21:31:13,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:13,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 21:31:13,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:13,533 INFO L375 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-11-15 21:31:13,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:13,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:31:13,551 INFO L375 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-11-15 21:31:13,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:13,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 21:31:13,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:13,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:13,691 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 21:31:13,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 21:31:13,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:13,714 INFO L496 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-11-15 21:31:13,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-15 21:31:13,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:13,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:31:13,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:13,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 21:31:13,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:13,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:13,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:13,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-15 21:31:13,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:13,974 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-15 21:31:13,975 INFO L496 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-11-15 21:31:13,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-15 21:31:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:14,028 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:31:14,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 21:31:14,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144742360] [2019-11-15 21:31:14,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:31:14,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:14,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:31:14,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:31:14,030 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 18 states. [2019-11-15 21:31:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:15,815 INFO L93 Difference]: Finished difference Result 253 states and 271 transitions. [2019-11-15 21:31:15,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:31:15,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-15 21:31:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:15,819 INFO L225 Difference]: With dead ends: 253 [2019-11-15 21:31:15,819 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 21:31:15,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:31:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 21:31:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 172. [2019-11-15 21:31:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:31:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2019-11-15 21:31:15,841 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 41 [2019-11-15 21:31:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:15,842 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2019-11-15 21:31:15,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:31:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2019-11-15 21:31:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 21:31:15,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:15,844 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:16,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:16,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:16,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1767482703, now seen corresponding path program 1 times [2019-11-15 21:31:16,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:16,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049878108] [2019-11-15 21:31:16,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:16,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:16,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:16,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049878108] [2019-11-15 21:31:16,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054621745] [2019-11-15 21:31:16,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:16,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 21:31:16,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:16,774 INFO L375 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-11-15 21:31:16,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:16,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:16,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:16,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:31:16,793 INFO L375 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-11-15 21:31:16,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:16,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:16,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:16,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 21:31:16,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:16,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:16,899 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 21:31:16,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 21:31:16,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:16,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:16,918 INFO L496 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-11-15 21:31:16,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-15 21:31:17,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:17,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:31:17,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:17,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:17,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:17,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 21:31:17,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:17,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:17,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:17,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-15 21:31:17,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:17,154 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 21:31:17,155 INFO L496 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-11-15 21:31:17,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-15 21:31:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:17,212 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:31:17,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-15 21:31:17,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83322829] [2019-11-15 21:31:17,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 21:31:17,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:17,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 21:31:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:31:17,214 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand 17 states. [2019-11-15 21:31:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:18,553 INFO L93 Difference]: Finished difference Result 258 states and 276 transitions. [2019-11-15 21:31:18,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:31:18,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-15 21:31:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:18,556 INFO L225 Difference]: With dead ends: 258 [2019-11-15 21:31:18,556 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 21:31:18,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:31:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 21:31:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 189. [2019-11-15 21:31:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-15 21:31:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 230 transitions. [2019-11-15 21:31:18,564 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 230 transitions. Word has length 41 [2019-11-15 21:31:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:18,565 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 230 transitions. [2019-11-15 21:31:18,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 21:31:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 230 transitions. [2019-11-15 21:31:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:31:18,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:18,567 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:18,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:18,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1221868424, now seen corresponding path program 1 times [2019-11-15 21:31:18,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:18,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821085087] [2019-11-15 21:31:18,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:18,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:18,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:31:19,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821085087] [2019-11-15 21:31:19,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:19,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-15 21:31:19,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444717493] [2019-11-15 21:31:19,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:31:19,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:31:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:31:19,433 INFO L87 Difference]: Start difference. First operand 189 states and 230 transitions. Second operand 18 states. [2019-11-15 21:31:19,688 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 21:31:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:22,341 INFO L93 Difference]: Finished difference Result 256 states and 318 transitions. [2019-11-15 21:31:22,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:31:22,342 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-11-15 21:31:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:22,345 INFO L225 Difference]: With dead ends: 256 [2019-11-15 21:31:22,345 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 21:31:22,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2019-11-15 21:31:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 21:31:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 205. [2019-11-15 21:31:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 21:31:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 268 transitions. [2019-11-15 21:31:22,358 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 268 transitions. Word has length 44 [2019-11-15 21:31:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:22,358 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 268 transitions. [2019-11-15 21:31:22,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:31:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 268 transitions. [2019-11-15 21:31:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:31:22,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:22,360 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:22,360 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:22,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1221868423, now seen corresponding path program 1 times [2019-11-15 21:31:22,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:22,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090366265] [2019-11-15 21:31:22,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:22,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:22,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:23,538 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 21:31:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:31:23,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090366265] [2019-11-15 21:31:23,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:23,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-15 21:31:23,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925738248] [2019-11-15 21:31:23,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 21:31:23,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:23,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 21:31:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:31:23,557 INFO L87 Difference]: Start difference. First operand 205 states and 268 transitions. Second operand 19 states. [2019-11-15 21:31:24,185 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 21:31:24,633 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:31:26,668 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 21:31:27,055 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 21:31:27,502 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 21:31:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:29,871 INFO L93 Difference]: Finished difference Result 256 states and 316 transitions. [2019-11-15 21:31:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:31:29,873 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2019-11-15 21:31:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:29,876 INFO L225 Difference]: With dead ends: 256 [2019-11-15 21:31:29,876 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 21:31:29,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:31:29,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 21:31:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 205. [2019-11-15 21:31:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 21:31:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 264 transitions. [2019-11-15 21:31:29,893 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 264 transitions. Word has length 44 [2019-11-15 21:31:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:29,893 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 264 transitions. [2019-11-15 21:31:29,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 21:31:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 264 transitions. [2019-11-15 21:31:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:31:29,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:29,895 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:29,895 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:29,895 INFO L82 PathProgramCache]: Analyzing trace with hash 776782902, now seen corresponding path program 1 times [2019-11-15 21:31:29,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:29,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46147313] [2019-11-15 21:31:29,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:29,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:29,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:31:29,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46147313] [2019-11-15 21:31:29,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:29,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:31:29,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935014151] [2019-11-15 21:31:29,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:31:29,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:29,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:31:29,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:31:29,993 INFO L87 Difference]: Start difference. First operand 205 states and 264 transitions. Second operand 5 states. [2019-11-15 21:31:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:30,295 INFO L93 Difference]: Finished difference Result 212 states and 256 transitions. [2019-11-15 21:31:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:31:30,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 21:31:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:30,298 INFO L225 Difference]: With dead ends: 212 [2019-11-15 21:31:30,298 INFO L226 Difference]: Without dead ends: 212 [2019-11-15 21:31:30,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:31:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-15 21:31:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-11-15 21:31:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-15 21:31:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 238 transitions. [2019-11-15 21:31:30,307 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 238 transitions. Word has length 45 [2019-11-15 21:31:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:30,307 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 238 transitions. [2019-11-15 21:31:30,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:31:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 238 transitions. [2019-11-15 21:31:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:31:30,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:30,309 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:30,310 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1689513925, now seen corresponding path program 1 times [2019-11-15 21:31:30,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:30,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76900794] [2019-11-15 21:31:30,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:30,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:30,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:31:30,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76900794] [2019-11-15 21:31:30,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:30,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:31:30,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515786869] [2019-11-15 21:31:30,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:31:30,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:31:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:31:30,470 INFO L87 Difference]: Start difference. First operand 195 states and 238 transitions. Second operand 8 states. [2019-11-15 21:31:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:30,973 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2019-11-15 21:31:30,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:31:30,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-15 21:31:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:30,975 INFO L225 Difference]: With dead ends: 206 [2019-11-15 21:31:30,975 INFO L226 Difference]: Without dead ends: 206 [2019-11-15 21:31:30,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:31:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-15 21:31:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2019-11-15 21:31:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 21:31:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 234 transitions. [2019-11-15 21:31:30,983 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 234 transitions. Word has length 46 [2019-11-15 21:31:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:30,983 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 234 transitions. [2019-11-15 21:31:30,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:31:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2019-11-15 21:31:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:31:30,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:30,985 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:30,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash -834368037, now seen corresponding path program 1 times [2019-11-15 21:31:30,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:30,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733215172] [2019-11-15 21:31:30,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:30,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:30,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:31:31,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733215172] [2019-11-15 21:31:31,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:31,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:31:31,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421937878] [2019-11-15 21:31:31,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:31:31,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:31:31,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:31:31,146 INFO L87 Difference]: Start difference. First operand 193 states and 234 transitions. Second operand 9 states. [2019-11-15 21:31:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:31,779 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2019-11-15 21:31:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:31:31,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-11-15 21:31:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:31,782 INFO L225 Difference]: With dead ends: 202 [2019-11-15 21:31:31,782 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 21:31:31,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:31:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 21:31:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2019-11-15 21:31:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-15 21:31:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 226 transitions. [2019-11-15 21:31:31,793 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 226 transitions. Word has length 47 [2019-11-15 21:31:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:31,793 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 226 transitions. [2019-11-15 21:31:31,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:31:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 226 transitions. [2019-11-15 21:31:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:31:31,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:31,795 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:31,795 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -95606989, now seen corresponding path program 1 times [2019-11-15 21:31:31,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:31,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534035583] [2019-11-15 21:31:31,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:31,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:31,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:31:31,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534035583] [2019-11-15 21:31:31,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:31,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:31:31,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133513134] [2019-11-15 21:31:31,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:31:31,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:31:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:31:31,907 INFO L87 Difference]: Start difference. First operand 189 states and 226 transitions. Second operand 6 states. [2019-11-15 21:31:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:32,307 INFO L93 Difference]: Finished difference Result 205 states and 242 transitions. [2019-11-15 21:31:32,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:31:32,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-15 21:31:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:32,310 INFO L225 Difference]: With dead ends: 205 [2019-11-15 21:31:32,310 INFO L226 Difference]: Without dead ends: 205 [2019-11-15 21:31:32,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-11-15 21:31:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-15 21:31:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-15 21:31:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-15 21:31:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2019-11-15 21:31:32,317 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 48 [2019-11-15 21:31:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:32,318 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2019-11-15 21:31:32,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:31:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2019-11-15 21:31:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:31:32,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:32,319 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:32,319 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -95606988, now seen corresponding path program 1 times [2019-11-15 21:31:32,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:32,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869696774] [2019-11-15 21:31:32,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:32,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:32,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:33,459 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 21:31:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:31:33,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869696774] [2019-11-15 21:31:33,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300881607] [2019-11-15 21:31:33,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:33,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:31:33,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:31:33,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:31:33,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [20] total 22 [2019-11-15 21:31:33,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212742383] [2019-11-15 21:31:33,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:31:33,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:33,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:31:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:31:33,752 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand 4 states. [2019-11-15 21:31:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:33,932 INFO L93 Difference]: Finished difference Result 187 states and 222 transitions. [2019-11-15 21:31:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:31:33,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 21:31:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:33,935 INFO L225 Difference]: With dead ends: 187 [2019-11-15 21:31:33,935 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 21:31:33,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:31:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 21:31:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-11-15 21:31:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 21:31:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 222 transitions. [2019-11-15 21:31:33,946 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 222 transitions. Word has length 48 [2019-11-15 21:31:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:33,947 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 222 transitions. [2019-11-15 21:31:33,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:31:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 222 transitions. [2019-11-15 21:31:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 21:31:33,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:33,948 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:34,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:34,149 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1331150665, now seen corresponding path program 1 times [2019-11-15 21:31:34,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:34,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355541765] [2019-11-15 21:31:34,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:34,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:34,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 21:31:34,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355541765] [2019-11-15 21:31:34,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:34,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:31:34,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082830873] [2019-11-15 21:31:34,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:31:34,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:31:34,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:31:34,278 INFO L87 Difference]: Start difference. First operand 187 states and 222 transitions. Second operand 8 states. [2019-11-15 21:31:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:35,007 INFO L93 Difference]: Finished difference Result 197 states and 230 transitions. [2019-11-15 21:31:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:31:35,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-15 21:31:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:35,009 INFO L225 Difference]: With dead ends: 197 [2019-11-15 21:31:35,009 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 21:31:35,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:31:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 21:31:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-11-15 21:31:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-15 21:31:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 216 transitions. [2019-11-15 21:31:35,021 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 216 transitions. Word has length 49 [2019-11-15 21:31:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:35,022 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 216 transitions. [2019-11-15 21:31:35,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:31:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 216 transitions. [2019-11-15 21:31:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 21:31:35,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:35,023 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:35,024 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1331150666, now seen corresponding path program 1 times [2019-11-15 21:31:35,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:35,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837570381] [2019-11-15 21:31:35,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:35,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:35,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 21:31:35,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837570381] [2019-11-15 21:31:35,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:35,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:31:35,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409771043] [2019-11-15 21:31:35,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:31:35,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:31:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:31:35,241 INFO L87 Difference]: Start difference. First operand 184 states and 216 transitions. Second operand 9 states. [2019-11-15 21:31:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:35,835 INFO L93 Difference]: Finished difference Result 194 states and 224 transitions. [2019-11-15 21:31:35,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:31:35,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-15 21:31:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:35,839 INFO L225 Difference]: With dead ends: 194 [2019-11-15 21:31:35,839 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 21:31:35,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:31:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 21:31:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-11-15 21:31:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-15 21:31:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2019-11-15 21:31:35,845 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 49 [2019-11-15 21:31:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:35,845 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2019-11-15 21:31:35,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:31:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2019-11-15 21:31:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 21:31:35,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:35,846 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:35,847 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:35,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash -59799966, now seen corresponding path program 2 times [2019-11-15 21:31:35,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:35,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144108004] [2019-11-15 21:31:35,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:35,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:35,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:36,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144108004] [2019-11-15 21:31:36,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886883221] [2019-11-15 21:31:36,002 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:36,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:31:36,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:31:36,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:31:36,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:36,250 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:31:36,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-15 21:31:36,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065904579] [2019-11-15 21:31:36,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:31:36,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:36,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:31:36,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:31:36,252 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 10 states. [2019-11-15 21:31:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:36,652 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2019-11-15 21:31:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:31:36,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-11-15 21:31:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:36,654 INFO L225 Difference]: With dead ends: 139 [2019-11-15 21:31:36,654 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 21:31:36,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:31:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 21:31:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2019-11-15 21:31:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 21:31:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2019-11-15 21:31:36,658 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 49 [2019-11-15 21:31:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:36,659 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2019-11-15 21:31:36,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:31:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2019-11-15 21:31:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:31:36,659 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:36,660 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:31:36,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:36,865 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:31:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash 876447991, now seen corresponding path program 1 times [2019-11-15 21:31:36,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:36,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804979114] [2019-11-15 21:31:36,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:36,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:36,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:38,466 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 21:31:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:38,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804979114] [2019-11-15 21:31:38,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097918970] [2019-11-15 21:31:38,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:31:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:38,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-15 21:31:38,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:38,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:38,711 INFO L375 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-11-15 21:31:38,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:38,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:38,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:38,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 21:31:38,781 INFO L375 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-11-15 21:31:38,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:38,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:38,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:38,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:31:38,826 INFO L375 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 28 treesize of output 23 [2019-11-15 21:31:38,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:38,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:38,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:38,841 INFO L375 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 18 treesize of output 22 [2019-11-15 21:31:38,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:38,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:38,846 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:38,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:38,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:38,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2019-11-15 21:31:38,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:31:38,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:38,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 111 [2019-11-15 21:31:38,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:31:38,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:38,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:31:38,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:38,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:31:39,051 INFO L567 ElimStorePlain]: treesize reduction 250, result has 18.3 percent of original size [2019-11-15 21:31:39,052 INFO L496 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-11-15 21:31:39,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:54 [2019-11-15 21:31:39,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-11-15 21:31:39,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:39,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:39,890 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_2|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_2|]} [2019-11-15 21:31:39,895 INFO L375 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-11-15 21:31:39,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:31:39,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:39,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:31:39,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 59 [2019-11-15 21:31:39,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:39,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:39,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:39,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:39,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:39,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:31:39,954 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:31:39,995 INFO L567 ElimStorePlain]: treesize reduction 28, result has 37.8 percent of original size [2019-11-15 21:31:39,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:31:39,996 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:90, output treesize:10 [2019-11-15 21:32:13,724 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:32:13,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 129 [2019-11-15 21:32:13,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:32:13,855 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 21:32:13,855 INFO L567 ElimStorePlain]: treesize reduction 64, result has 71.6 percent of original size [2019-11-15 21:32:13,857 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_14|], 34=[|v_#memory_$Pointer$.base_BEFORE_CALL_3|]} [2019-11-15 21:32:13,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:13,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:13,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:13,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:13,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-11-15 21:32:13,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:32:13,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:32:13,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:13,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:13,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:13,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:14,321 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-11-15 21:32:14,321 INFO L341 Elim1Store]: treesize reduction 139, result has 65.7 percent of original size [2019-11-15 21:32:14,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 116 treesize of output 325 [2019-11-15 21:32:14,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:32:14,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:32:14,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:14,381 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:32:14,572 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-11-15 21:32:14,572 INFO L567 ElimStorePlain]: treesize reduction 300, result has 29.6 percent of original size [2019-11-15 21:32:14,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:32:14,574 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:147, output treesize:147 [2019-11-15 21:32:14,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:14,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:14,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-15 21:32:14,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:32:14,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:32:14,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 21:32:14,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:158, output treesize:129 [2019-11-15 21:32:14,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:32:15,155 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-15 21:32:15,155 INFO L341 Elim1Store]: treesize reduction 12, result has 91.6 percent of original size [2019-11-15 21:32:15,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 120 treesize of output 174 [2019-11-15 21:32:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:15,170 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:32:15,225 INFO L567 ElimStorePlain]: treesize reduction 88, result has 27.3 percent of original size [2019-11-15 21:32:15,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:32:15,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:28 [2019-11-15 21:32:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:32:15,447 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:32:15,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2019-11-15 21:32:15,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346140382] [2019-11-15 21:32:15,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 21:32:15,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:32:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 21:32:15,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1825, Unknown=14, NotChecked=0, Total=1980 [2019-11-15 21:32:15,450 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 45 states. [2019-11-15 21:32:18,332 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 21:32:25,252 WARN L191 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 21:32:50,668 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-11-15 21:32:53,028 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 21:32:55,362 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 21:32:57,792 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 21:33:02,582 WARN L191 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 144 DAG size of output: 133 [2019-11-15 21:33:07,077 WARN L191 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-15 21:33:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:19,217 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-15 21:33:19,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 21:33:19,220 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2019-11-15 21:33:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:19,221 INFO L225 Difference]: With dead ends: 127 [2019-11-15 21:33:19,221 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 21:33:19,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 64.7s TimeCoverageRelationStatistics Valid=326, Invalid=3562, Unknown=18, NotChecked=0, Total=3906 [2019-11-15 21:33:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 21:33:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2019-11-15 21:33:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:33:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-11-15 21:33:19,226 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 52 [2019-11-15 21:33:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:19,226 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-11-15 21:33:19,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 21:33:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-11-15 21:33:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:33:19,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:19,228 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:19,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:19,428 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:33:19,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:19,429 INFO L82 PathProgramCache]: Analyzing trace with hash 876447992, now seen corresponding path program 1 times [2019-11-15 21:33:19,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:19,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609282734] [2019-11-15 21:33:19,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:19,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:19,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:21,390 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:33:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:21,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609282734] [2019-11-15 21:33:21,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869211652] [2019-11-15 21:33:21,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:33:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:21,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 105 conjunts are in the unsatisfiable core [2019-11-15 21:33:21,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:21,643 INFO L375 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-11-15 21:33:21,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:21,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:21,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:33:21,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:33:21,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:21,819 INFO L375 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-11-15 21:33:21,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:21,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:21,836 INFO L375 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-11-15 21:33:21,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:21,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:21,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:33:21,848 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2019-11-15 21:33:21,988 INFO L375 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-11-15 21:33:21,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:22,018 INFO L375 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-11-15 21:33:22,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:22,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2019-11-15 21:33:22,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:22,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:33:22,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:22,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:22,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:33:22,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:22,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2019-11-15 21:33:22,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:22,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:22,375 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:33:22,387 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:22,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 99 [2019-11-15 21:33:22,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,475 INFO L567 ElimStorePlain]: treesize reduction 49, result has 72.0 percent of original size [2019-11-15 21:33:22,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:22,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 61 [2019-11-15 21:33:22,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:22,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:33:22,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:155, output treesize:116 [2019-11-15 21:33:23,535 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_10|], 1=[|v_#length_BEFORE_CALL_7|]} [2019-11-15 21:33:23,541 INFO L375 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-11-15 21:33:23,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:23,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:23,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2019-11-15 21:33:23,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:23,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:23,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:23,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:23,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:23,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:23,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 142 [2019-11-15 21:33:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,675 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:33:23,739 INFO L567 ElimStorePlain]: treesize reduction 60, result has 61.5 percent of original size [2019-11-15 21:33:23,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:23,805 INFO L375 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 4 case distinctions, treesize of input 77 treesize of output 78 [2019-11-15 21:33:23,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:23,811 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:23,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:23,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:33:23,840 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:239, output treesize:13 [2019-11-15 21:33:54,455 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_11|], 3=[|v_old(#length)_AFTER_CALL_16|]} [2019-11-15 21:33:54,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:54,470 INFO L375 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 15 treesize of output 19 [2019-11-15 21:33:54,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:54,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:54,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:54,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 96 [2019-11-15 21:33:54,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:54,807 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-15 21:33:54,807 INFO L567 ElimStorePlain]: treesize reduction 56, result has 83.6 percent of original size [2019-11-15 21:33:54,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:54,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:54,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:54,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:54,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:54,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:54,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:55,285 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-11-15 21:33:55,286 INFO L341 Elim1Store]: treesize reduction 189, result has 65.1 percent of original size [2019-11-15 21:33:55,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 234 treesize of output 484 [2019-11-15 21:33:55,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:33:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:55,345 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:33:55,727 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 77 [2019-11-15 21:33:55,727 INFO L567 ElimStorePlain]: treesize reduction 448, result has 41.2 percent of original size [2019-11-15 21:33:55,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:55,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:55,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:55,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:55,906 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-15 21:33:55,907 INFO L341 Elim1Store]: treesize reduction 43, result has 73.9 percent of original size [2019-11-15 21:33:55,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 253 treesize of output 273 [2019-11-15 21:33:55,910 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:33:56,125 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-11-15 21:33:56,125 INFO L567 ElimStorePlain]: treesize reduction 278, result has 54.4 percent of original size [2019-11-15 21:33:56,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:56,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:56,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:33:56,130 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:293, output treesize:426 [2019-11-15 21:33:56,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:56,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:56,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:56,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:56,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:56,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:33:57,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,778 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:57,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 303 treesize of output 328 [2019-11-15 21:33:57,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,811 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:33:57,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:57,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 375 treesize of output 291 [2019-11-15 21:33:57,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:57,922 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:33:57,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:57,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:58,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:58,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 375 treesize of output 291 [2019-11-15 21:33:58,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,039 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:33:58,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:58,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:58,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:33:58,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:33:58,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 334 treesize of output 276 [2019-11-15 21:33:58,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:58,147 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:33:58,650 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 145 [2019-11-15 21:33:58,650 INFO L567 ElimStorePlain]: treesize reduction 457, result has 55.7 percent of original size [2019-11-15 21:33:58,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:58,852 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 21:33:58,857 INFO L168 Benchmark]: Toolchain (without parser) took 176385.03 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 944.7 MB in the beginning and 962.2 MB in the end (delta: -17.5 MB). Peak memory consumption was 429.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:58,857 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:33:58,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:58,858 INFO L168 Benchmark]: Boogie Preprocessor took 101.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:33:58,858 INFO L168 Benchmark]: RCFGBuilder took 1309.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.8 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:58,859 INFO L168 Benchmark]: TraceAbstraction took 174187.36 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.1 MB). Free memory was 1.0 GB in the beginning and 962.2 MB in the end (delta: 72.6 MB). Peak memory consumption was 377.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:58,861 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 782.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1309.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.8 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 174187.36 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.1 MB). Free memory was 1.0 GB in the beginning and 962.2 MB in the end (delta: 72.6 MB). Peak memory consumption was 377.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:34:01,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:34:01,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:34:01,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:34:01,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:34:01,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:34:01,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:34:01,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:34:01,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:34:01,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:34:01,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:34:01,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:34:01,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:34:01,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:34:01,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:34:01,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:34:01,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:34:01,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:34:01,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:34:01,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:34:01,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:34:01,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:34:01,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:34:01,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:34:01,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:34:01,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:34:01,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:34:01,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:34:01,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:34:01,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:34:01,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:34:01,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:34:01,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:34:01,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:34:01,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:34:01,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:34:01,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:34:01,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:34:01,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:34:01,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:34:01,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:34:01,518 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:34:01,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:34:01,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:34:01,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:34:01,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:34:01,537 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:34:01,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:34:01,538 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:34:01,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:34:01,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:34:01,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:34:01,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:34:01,539 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:34:01,539 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:34:01,540 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:34:01,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:34:01,540 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:34:01,540 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:34:01,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:34:01,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:34:01,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:34:01,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:34:01,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:34:01,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:34:01,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:34:01,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:34:01,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:34:01,543 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:34:01,544 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:34:01,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:34:01,544 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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 -> b7a6c79ad5924d178a48cf0cbbdc1138caa9a120 [2019-11-15 21:34:01,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:34:01,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:34:01,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:34:01,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:34:01,616 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:34:01,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2019-11-15 21:34:01,690 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/b01cded88/28a462d0ba9245e3bfaa4c5ca944629c/FLAG037d736b5 [2019-11-15 21:34:02,271 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:34:02,272 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2019-11-15 21:34:02,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/b01cded88/28a462d0ba9245e3bfaa4c5ca944629c/FLAG037d736b5 [2019-11-15 21:34:02,492 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/data/b01cded88/28a462d0ba9245e3bfaa4c5ca944629c [2019-11-15 21:34:02,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:34:02,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:34:02,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:34:02,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:34:02,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:34:02,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:34:02" (1/1) ... [2019-11-15 21:34:02,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1d2a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:02, skipping insertion in model container [2019-11-15 21:34:02,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:34:02" (1/1) ... [2019-11-15 21:34:02,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:34:02,583 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:34:03,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:34:03,092 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:34:03,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:34:03,222 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:34:03,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03 WrapperNode [2019-11-15 21:34:03,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:34:03,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:34:03,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:34:03,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:34:03,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... [2019-11-15 21:34:03,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... [2019-11-15 21:34:03,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... [2019-11-15 21:34:03,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... [2019-11-15 21:34:03,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... [2019-11-15 21:34:03,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... [2019-11-15 21:34:03,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... [2019-11-15 21:34:03,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:34:03,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:34:03,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:34:03,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:34:03,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/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-11-15 21:34:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:34:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:34:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:34:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:34:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:34:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:34:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-15 21:34:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-11-15 21:34:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2019-11-15 21:34:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:34:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:34:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:34:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:34:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:34:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:34:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:34:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:34:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:34:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:34:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:34:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:34:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:34:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:34:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:34:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:34:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:34:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:34:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:34:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:34:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:34:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:34:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:34:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:34:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:34:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:34:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:34:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:34:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:34:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:34:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:34:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:34:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:34:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:34:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:34:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:34:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:34:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:34:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:34:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:34:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:34:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:34:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:34:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:34:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:34:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:34:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:34:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:34:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:34:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:34:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:34:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:34:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:34:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:34:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:34:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:34:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:34:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:34:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:34:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:34:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:34:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:34:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:34:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:34:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:34:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:34:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:34:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:34:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:34:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:34:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:34:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:34:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:34:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:34:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:34:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:34:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:34:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:34:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:34:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:34:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:34:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:34:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:34:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:34:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:34:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:34:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:34:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:34:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:34:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:34:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:34:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:34:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:34:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:34:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:34:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:34:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:34:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:34:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:34:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:34:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:34:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:34:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:34:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:34:03,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:34:03,420 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-15 21:34:03,420 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-11-15 21:34:03,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:34:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:34:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2019-11-15 21:34:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:34:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:34:03,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:34:03,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:34:03,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:34:03,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:34:03,938 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:34:04,789 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:34:04,789 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:34:04,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:04 BoogieIcfgContainer [2019-11-15 21:34:04,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:34:04,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:34:04,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:34:04,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:34:04,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:34:02" (1/3) ... [2019-11-15 21:34:04,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a19c9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:34:04, skipping insertion in model container [2019-11-15 21:34:04,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:03" (2/3) ... [2019-11-15 21:34:04,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a19c9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:34:04, skipping insertion in model container [2019-11-15 21:34:04,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:04" (3/3) ... [2019-11-15 21:34:04,802 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2019-11-15 21:34:04,815 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:34:04,825 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 60 error locations. [2019-11-15 21:34:04,838 INFO L249 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2019-11-15 21:34:04,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:34:04,861 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:34:04,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:34:04,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:34:04,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:34:04,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:34:04,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:34:04,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:34:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-15 21:34:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:34:04,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:04,911 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:04,914 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:34:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash -485580583, now seen corresponding path program 1 times [2019-11-15 21:34:04,934 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:34:04,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1496114367] [2019-11-15 21:34:04,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b6cdff0-af23-4a2d-bed1-8bd366746356/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:34:05,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:34:05,172 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:34:05,180 INFO L168 Benchmark]: Toolchain (without parser) took 2681.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -91.5 MB). Peak memory consumption was 62.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:05,180 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:34:05,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:05,184 INFO L168 Benchmark]: Boogie Preprocessor took 93.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:34:05,185 INFO L168 Benchmark]: RCFGBuilder took 1473.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:05,185 INFO L168 Benchmark]: TraceAbstraction took 384.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:05,190 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.43 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 722.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1473.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 384.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...