./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.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_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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 1a84b349ed554162d37455efc2adb7bf93e2048b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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 1a84b349ed554162d37455efc2adb7bf93e2048b ................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:10:47,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:10:47,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:10:47,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:10:47,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:10:47,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:10:47,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:10:47,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:10:47,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:10:47,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:10:47,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:10:47,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:10:47,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:10:47,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:10:47,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:10:47,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:10:47,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:10:47,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:10:47,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:10:47,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:10:47,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:10:47,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:10:47,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:10:47,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:10:47,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:10:47,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:10:47,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:10:47,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:10:47,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:10:47,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:10:47,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:10:47,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:10:47,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:10:47,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:10:47,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:10:47,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:10:47,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:10:47,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:10:47,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:10:47,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:10:47,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:10:47,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:10:47,950 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:10:47,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:10:47,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:10:47,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:10:47,952 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:10:47,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:10:47,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:10:47,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:10:47,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:10:47,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:10:47,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:10:47,954 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:10:47,954 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:10:47,954 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:10:47,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:10:47,955 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:10:47,955 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:10:47,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:10:47,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:10:47,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:10:47,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:10:47,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:10:47,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:10:47,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:10:47,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:10:47,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:10:47,957 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_0830507f-a29c-4a42-b153-9720644f4726/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 -> 1a84b349ed554162d37455efc2adb7bf93e2048b [2019-11-16 00:10:47,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:10:48,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:10:48,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:10:48,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:10:48,011 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:10:48,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2019-11-16 00:10:48,062 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/840fbcc4d/876178fd14694c79935b29f8abaa364f/FLAG898c8cf5f [2019-11-16 00:10:48,564 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:10:48,565 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2019-11-16 00:10:48,576 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/840fbcc4d/876178fd14694c79935b29f8abaa364f/FLAG898c8cf5f [2019-11-16 00:10:49,031 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/840fbcc4d/876178fd14694c79935b29f8abaa364f [2019-11-16 00:10:49,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:10:49,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:10:49,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:10:49,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:10:49,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:10:49,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4fb585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49, skipping insertion in model container [2019-11-16 00:10:49,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,048 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:10:49,088 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:10:49,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:10:49,434 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:10:49,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:10:49,567 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:10:49,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49 WrapperNode [2019-11-16 00:10:49,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:10:49,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:10:49,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:10:49,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:10:49,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... [2019-11-16 00:10:49,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:10:49,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:10:49,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:10:49,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:10:49,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:10:49,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:10:49,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:10:49,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:10:49,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:10:49,700 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:10:49,700 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:10:49,701 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-16 00:10:49,701 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2019-11-16 00:10:49,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:10:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:10:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:10:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:10:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:10:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:10:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:10:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:10:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:10:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:10:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:10:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:10:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:10:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:10:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:10:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:10:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:10:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:10:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:10:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:10:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:10:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:10:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:10:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:10:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:10:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:10:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:10:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:10:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:10:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:10:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:10:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:10:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:10:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:10:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:10:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:10:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:10:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:10:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:10:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:10:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:10:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:10:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:10:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:10:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:10:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:10:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:10:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:10:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:10:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:10:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:10:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:10:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:10:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:10:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:10:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:10:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:10:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:10:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:10:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:10:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:10:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:10:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:10:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:10:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:10:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:10:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:10:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:10:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:10:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:10:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:10:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:10:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:10:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:10:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:10:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:10:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:10:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:10:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:10:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:10:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:10:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:10:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:10:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:10:49,723 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:10:49,723 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:10:49,723 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:10:49,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:10:49,723 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:10:49,723 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:10:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:10:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:10:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:10:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:10:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:10:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:10:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:10:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:10:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:10:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:10:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:10:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:10:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:10:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:10:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:10:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:10:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:10:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:10:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:10:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:10:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:10:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:10:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-16 00:10:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2019-11-16 00:10:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:10:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:10:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:10:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:10:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:10:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:10:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:10:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:10:50,263 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:10:50,466 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:10:50,467 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-16 00:10:50,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:10:50 BoogieIcfgContainer [2019-11-16 00:10:50,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:10:50,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:10:50,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:10:50,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:10:50,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:10:49" (1/3) ... [2019-11-16 00:10:50,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7750c289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:10:50, skipping insertion in model container [2019-11-16 00:10:50,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:49" (2/3) ... [2019-11-16 00:10:50,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7750c289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:10:50, skipping insertion in model container [2019-11-16 00:10:50,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:10:50" (3/3) ... [2019-11-16 00:10:50,478 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2019-11-16 00:10:50,489 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:10:50,498 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-11-16 00:10:50,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-11-16 00:10:50,527 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:10:50,527 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:10:50,527 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:10:50,527 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:10:50,527 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:10:50,528 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:10:50,528 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:10:50,528 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:10:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-11-16 00:10:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:10:50,555 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:50,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:50,557 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1218522858, now seen corresponding path program 1 times [2019-11-16 00:10:50,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:50,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860561230] [2019-11-16 00:10:50,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:50,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:50,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,754 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-16 00:10:50,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860561230] [2019-11-16 00:10:50,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:50,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:10:50,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877691941] [2019-11-16 00:10:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:10:50,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:50,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:10:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:10:50,773 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 4 states. [2019-11-16 00:10:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:51,078 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2019-11-16 00:10:51,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:10:51,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:10:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:51,089 INFO L225 Difference]: With dead ends: 108 [2019-11-16 00:10:51,090 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:10:51,095 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-16 00:10:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:10:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-16 00:10:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-16 00:10:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-11-16 00:10:51,138 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 12 [2019-11-16 00:10:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:51,139 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-11-16 00:10:51,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:10:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-11-16 00:10:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:10:51,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:51,139 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:51,140 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1218522857, now seen corresponding path program 1 times [2019-11-16 00:10:51,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:51,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315210353] [2019-11-16 00:10:51,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:51,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:51,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,241 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-16 00:10:51,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315210353] [2019-11-16 00:10:51,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:51,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:10:51,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531923581] [2019-11-16 00:10:51,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:10:51,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:10:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:10:51,244 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 4 states. [2019-11-16 00:10:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:51,481 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-11-16 00:10:51,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:10:51,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:10:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:51,483 INFO L225 Difference]: With dead ends: 98 [2019-11-16 00:10:51,484 INFO L226 Difference]: Without dead ends: 98 [2019-11-16 00:10:51,484 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-16 00:10:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-16 00:10:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-16 00:10:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-16 00:10:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-11-16 00:10:51,500 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 12 [2019-11-16 00:10:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:51,501 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-11-16 00:10:51,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:10:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-11-16 00:10:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:10:51,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:51,502 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] [2019-11-16 00:10:51,503 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:51,503 INFO L82 PathProgramCache]: Analyzing trace with hash -646533640, now seen corresponding path program 1 times [2019-11-16 00:10:51,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:51,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689219114] [2019-11-16 00:10:51,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:51,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:51,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,661 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-16 00:10:51,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689219114] [2019-11-16 00:10:51,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:51,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:10:51,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683224979] [2019-11-16 00:10:51,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:10:51,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:10:51,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:10:51,663 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 7 states. [2019-11-16 00:10:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:52,191 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-11-16 00:10:52,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:10:52,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-16 00:10:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:52,196 INFO L225 Difference]: With dead ends: 99 [2019-11-16 00:10:52,196 INFO L226 Difference]: Without dead ends: 99 [2019-11-16 00:10:52,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:10:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-16 00:10:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-16 00:10:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-16 00:10:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-11-16 00:10:52,208 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 20 [2019-11-16 00:10:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:52,215 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-11-16 00:10:52,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:10:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-11-16 00:10:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:10:52,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:52,216 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] [2019-11-16 00:10:52,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1481740797, now seen corresponding path program 1 times [2019-11-16 00:10:52,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:52,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315725934] [2019-11-16 00:10:52,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:52,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:52,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:10:52,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315725934] [2019-11-16 00:10:52,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:52,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:10:52,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305640205] [2019-11-16 00:10:52,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:10:52,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:52,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:10:52,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:10:52,506 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 9 states. [2019-11-16 00:10:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:53,098 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-11-16 00:10:53,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:10:53,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-16 00:10:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:53,101 INFO L225 Difference]: With dead ends: 99 [2019-11-16 00:10:53,101 INFO L226 Difference]: Without dead ends: 99 [2019-11-16 00:10:53,102 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-16 00:10:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-16 00:10:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-16 00:10:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-16 00:10:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-11-16 00:10:53,110 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 30 [2019-11-16 00:10:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:53,110 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-11-16 00:10:53,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:10:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-11-16 00:10:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:10:53,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:53,111 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] [2019-11-16 00:10:53,112 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1481740796, now seen corresponding path program 1 times [2019-11-16 00:10:53,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:53,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622982084] [2019-11-16 00:10:53,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:53,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:53,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:10:53,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622982084] [2019-11-16 00:10:53,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:53,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:10:53,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798855756] [2019-11-16 00:10:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:10:53,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:10:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:10:53,235 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 8 states. [2019-11-16 00:10:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:53,627 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-11-16 00:10:53,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:10:53,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-16 00:10:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:53,629 INFO L225 Difference]: With dead ends: 98 [2019-11-16 00:10:53,629 INFO L226 Difference]: Without dead ends: 98 [2019-11-16 00:10:53,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:10:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-16 00:10:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-11-16 00:10:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-16 00:10:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-11-16 00:10:53,636 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 30 [2019-11-16 00:10:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:53,636 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-11-16 00:10:53,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:10:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-11-16 00:10:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:10:53,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:53,637 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] [2019-11-16 00:10:53,638 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:53,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1976237667, now seen corresponding path program 1 times [2019-11-16 00:10:53,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:53,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376376228] [2019-11-16 00:10:53,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:53,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:53,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:10:53,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376376228] [2019-11-16 00:10:53,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176926343] [2019-11-16 00:10:53,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:10:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:10:53,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:54,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:10:54,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,140 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 23 [2019-11-16 00:10:54,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,164 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:10:54,165 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-16 00:10:54,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-16 00:10:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:54,175 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:54,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-16 00:10:54,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654775889] [2019-11-16 00:10:54,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:10:54,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:10:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:10:54,177 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 12 states. [2019-11-16 00:10:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:55,034 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-11-16 00:10:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:10:55,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-16 00:10:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:55,036 INFO L225 Difference]: With dead ends: 105 [2019-11-16 00:10:55,036 INFO L226 Difference]: Without dead ends: 105 [2019-11-16 00:10:55,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:10:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-16 00:10:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-11-16 00:10:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-16 00:10:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-16 00:10:55,044 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 32 [2019-11-16 00:10:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:55,044 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-16 00:10:55,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:10:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-16 00:10:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:10:55,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:55,045 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] [2019-11-16 00:10:55,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:55,249 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1976237666, now seen corresponding path program 1 times [2019-11-16 00:10:55,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:55,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357355749] [2019-11-16 00:10:55,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:55,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:55,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:10:55,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357355749] [2019-11-16 00:10:55,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320674020] [2019-11-16 00:10:55,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:10:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:55,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:10:55,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:55,701 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-16 00:10:55,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:55,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:55,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:55,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:10:55,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:55,876 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-16 00:10:55,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:55,892 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-16 00:10:55,892 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-16 00:10:55,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-16 00:10:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:55,903 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:55,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-16 00:10:55,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300053022] [2019-11-16 00:10:55,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:10:55,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:10:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:10:55,904 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 16 states. [2019-11-16 00:10:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:56,798 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-11-16 00:10:56,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:10:56,799 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-16 00:10:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:56,800 INFO L225 Difference]: With dead ends: 105 [2019-11-16 00:10:56,800 INFO L226 Difference]: Without dead ends: 105 [2019-11-16 00:10:56,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:10:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-16 00:10:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-11-16 00:10:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-16 00:10:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-11-16 00:10:56,812 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 32 [2019-11-16 00:10:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:56,812 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-11-16 00:10:56,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:10:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-11-16 00:10:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:10:56,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:56,814 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] [2019-11-16 00:10:57,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:57,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,022 INFO L82 PathProgramCache]: Analyzing trace with hash -788699084, now seen corresponding path program 1 times [2019-11-16 00:10:57,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972047199] [2019-11-16 00:10:57,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:10:57,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972047199] [2019-11-16 00:10:57,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128792029] [2019-11-16 00:10:57,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:10:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:10:57,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:10:57,334 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:57,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-16 00:10:57,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367779074] [2019-11-16 00:10:57,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:10:57,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:10:57,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:10:57,335 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 8 states. [2019-11-16 00:10:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:57,656 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-16 00:10:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:10:57,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-16 00:10:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:57,658 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:10:57,658 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:10:57,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:10:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:10:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-11-16 00:10:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-16 00:10:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2019-11-16 00:10:57,663 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 34 [2019-11-16 00:10:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:57,664 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2019-11-16 00:10:57,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:10:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2019-11-16 00:10:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:10:57,665 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:57,665 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] [2019-11-16 00:10:57,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:57,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1315351477, now seen corresponding path program 1 times [2019-11-16 00:10:57,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937432297] [2019-11-16 00:10:57,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:10:58,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937432297] [2019-11-16 00:10:58,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761002082] [2019-11-16 00:10:58,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:10:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:58,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:10:58,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:10:58,247 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:58,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-16 00:10:58,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124775377] [2019-11-16 00:10:58,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:10:58,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:58,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:10:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:10:58,249 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 11 states. [2019-11-16 00:10:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:58,795 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-11-16 00:10:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:10:58,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-16 00:10:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:58,798 INFO L225 Difference]: With dead ends: 113 [2019-11-16 00:10:58,798 INFO L226 Difference]: Without dead ends: 113 [2019-11-16 00:10:58,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:10:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-16 00:10:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2019-11-16 00:10:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:10:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-16 00:10:58,803 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 35 [2019-11-16 00:10:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:58,804 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-16 00:10:58,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:10:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-16 00:10:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:10:58,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:58,806 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] [2019-11-16 00:10:59,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:59,007 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1315351476, now seen corresponding path program 1 times [2019-11-16 00:10:59,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:59,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032651570] [2019-11-16 00:10:59,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:59,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:59,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:10:59,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032651570] [2019-11-16 00:10:59,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656872285] [2019-11-16 00:10:59,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:10:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:10:59,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:10:59,292 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:59,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 6 [2019-11-16 00:10:59,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723475257] [2019-11-16 00:10:59,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:10:59,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:10:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:10:59,294 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 7 states. [2019-11-16 00:10:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:59,620 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-16 00:10:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:10:59,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-16 00:10:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:59,627 INFO L225 Difference]: With dead ends: 106 [2019-11-16 00:10:59,627 INFO L226 Difference]: Without dead ends: 106 [2019-11-16 00:10:59,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:10:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-16 00:10:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-16 00:10:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:10:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-16 00:10:59,632 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 35 [2019-11-16 00:10:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:59,633 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-16 00:10:59,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:10:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-16 00:10:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:10:59,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:59,634 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] [2019-11-16 00:10:59,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:59,842 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2121190095, now seen corresponding path program 1 times [2019-11-16 00:10:59,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:59,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427990639] [2019-11-16 00:10:59,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:59,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:59,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:59,975 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-16 00:10:59,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427990639] [2019-11-16 00:10:59,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:59,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:10:59,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906109952] [2019-11-16 00:10:59,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:10:59,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:10:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:10:59,977 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 9 states. [2019-11-16 00:11:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:00,455 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-11-16 00:11:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:11:00,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-16 00:11:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:00,457 INFO L225 Difference]: With dead ends: 105 [2019-11-16 00:11:00,457 INFO L226 Difference]: Without dead ends: 105 [2019-11-16 00:11:00,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:11:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-16 00:11:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-11-16 00:11:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-16 00:11:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-11-16 00:11:00,461 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 36 [2019-11-16 00:11:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:00,462 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-11-16 00:11:00,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:11:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-11-16 00:11:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:11:00,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:00,463 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] [2019-11-16 00:11:00,464 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2121190096, now seen corresponding path program 1 times [2019-11-16 00:11:00,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:00,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864105726] [2019-11-16 00:11:00,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,672 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-16 00:11:00,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864105726] [2019-11-16 00:11:00,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:00,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:11:00,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195761410] [2019-11-16 00:11:00,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:11:00,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:11:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:11:00,674 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 10 states. [2019-11-16 00:11:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:01,111 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2019-11-16 00:11:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:11:01,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-16 00:11:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:01,113 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:11:01,113 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:11:01,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:11:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:11:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-16 00:11:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-16 00:11:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-11-16 00:11:01,117 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 36 [2019-11-16 00:11:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:01,117 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-11-16 00:11:01,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:11:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-11-16 00:11:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:11:01,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:01,119 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] [2019-11-16 00:11:01,119 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash -273377219, now seen corresponding path program 1 times [2019-11-16 00:11:01,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:01,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889832340] [2019-11-16 00:11:01,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,226 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-16 00:11:01,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889832340] [2019-11-16 00:11:01,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:01,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:11:01,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071142269] [2019-11-16 00:11:01,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:11:01,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:11:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:11:01,237 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 6 states. [2019-11-16 00:11:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:01,476 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-16 00:11:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:11:01,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-16 00:11:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:01,478 INFO L225 Difference]: With dead ends: 106 [2019-11-16 00:11:01,478 INFO L226 Difference]: Without dead ends: 106 [2019-11-16 00:11:01,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:11:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-16 00:11:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-16 00:11:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-16 00:11:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-11-16 00:11:01,483 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 42 [2019-11-16 00:11:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:01,484 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-11-16 00:11:01,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:11:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-11-16 00:11:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:11:01,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:01,488 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] [2019-11-16 00:11:01,488 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash -722365814, now seen corresponding path program 1 times [2019-11-16 00:11:01,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:01,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199848442] [2019-11-16 00:11:01,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:02,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199848442] [2019-11-16 00:11:02,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248600418] [2019-11-16 00:11:02,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:11:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:02,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:11:02,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:02,289 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-16 00:11:02,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:02,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:02,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:02,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:11:02,306 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-16 00:11:02,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:02,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:02,310 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-16 00:11:02,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:11:02,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:02,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:02,541 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:11:02,541 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-16 00:11:02,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:02,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:02,549 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-16 00:11:02,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-11-16 00:11:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:02,657 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:02,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-11-16 00:11:02,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875501207] [2019-11-16 00:11:02,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-16 00:11:02,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-16 00:11:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:11:02,660 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 24 states. [2019-11-16 00:11:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:03,762 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2019-11-16 00:11:03,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:11:03,762 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-11-16 00:11:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:03,763 INFO L225 Difference]: With dead ends: 138 [2019-11-16 00:11:03,764 INFO L226 Difference]: Without dead ends: 138 [2019-11-16 00:11:03,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:11:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-16 00:11:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 110. [2019-11-16 00:11:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:11:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-16 00:11:03,769 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 44 [2019-11-16 00:11:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:03,769 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-16 00:11:03,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-16 00:11:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-16 00:11:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:11:03,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:03,770 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] [2019-11-16 00:11:03,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:03,971 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash -722365813, now seen corresponding path program 1 times [2019-11-16 00:11:03,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:03,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490835178] [2019-11-16 00:11:03,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:03,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:03,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:11:04,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490835178] [2019-11-16 00:11:04,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801071199] [2019-11-16 00:11:04,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:11:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:04,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:11:04,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:04,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-16 00:11:04,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:04,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:04,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:04,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:11:04,548 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-16 00:11:04,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:04,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:04,552 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-16 00:11:04,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:11:04,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:04,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:04,738 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:11:04,738 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-16 00:11:04,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:04,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:04,753 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-16 00:11:04,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-11-16 00:11:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:04,858 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:04,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-11-16 00:11:04,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6827042] [2019-11-16 00:11:04,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:11:04,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:04,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:11:04,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:11:04,861 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 21 states. [2019-11-16 00:11:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:06,161 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2019-11-16 00:11:06,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:11:06,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-11-16 00:11:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:06,163 INFO L225 Difference]: With dead ends: 159 [2019-11-16 00:11:06,163 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:11:06,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:11:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:11:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2019-11-16 00:11:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-16 00:11:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2019-11-16 00:11:06,169 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 44 [2019-11-16 00:11:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:06,169 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2019-11-16 00:11:06,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:11:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2019-11-16 00:11:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:11:06,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:06,170 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] [2019-11-16 00:11:06,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:06,371 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:06,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash -918503686, now seen corresponding path program 1 times [2019-11-16 00:11:06,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:06,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371156867] [2019-11-16 00:11:06,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:06,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:06,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:06,591 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-16 00:11:06,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371156867] [2019-11-16 00:11:06,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:06,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:11:06,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345898123] [2019-11-16 00:11:06,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:11:06,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:06,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:11:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:11:06,593 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 15 states. [2019-11-16 00:11:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:07,377 INFO L93 Difference]: Finished difference Result 181 states and 220 transitions. [2019-11-16 00:11:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:11:07,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-11-16 00:11:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:07,378 INFO L225 Difference]: With dead ends: 181 [2019-11-16 00:11:07,379 INFO L226 Difference]: Without dead ends: 181 [2019-11-16 00:11:07,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:11:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-16 00:11:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 143. [2019-11-16 00:11:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:11:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 175 transitions. [2019-11-16 00:11:07,385 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 175 transitions. Word has length 45 [2019-11-16 00:11:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:07,386 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 175 transitions. [2019-11-16 00:11:07,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:11:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 175 transitions. [2019-11-16 00:11:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:11:07,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:07,387 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] [2019-11-16 00:11:07,388 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -918503685, now seen corresponding path program 1 times [2019-11-16 00:11:07,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:07,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797433421] [2019-11-16 00:11:07,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:07,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:07,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:07,832 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-16 00:11:07,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797433421] [2019-11-16 00:11:07,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:07,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-16 00:11:07,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18622578] [2019-11-16 00:11:07,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:11:07,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:11:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:11:07,836 INFO L87 Difference]: Start difference. First operand 143 states and 175 transitions. Second operand 16 states. [2019-11-16 00:11:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:08,848 INFO L93 Difference]: Finished difference Result 191 states and 233 transitions. [2019-11-16 00:11:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:11:08,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-11-16 00:11:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:08,849 INFO L225 Difference]: With dead ends: 191 [2019-11-16 00:11:08,849 INFO L226 Difference]: Without dead ends: 191 [2019-11-16 00:11:08,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:11:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-16 00:11:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2019-11-16 00:11:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:11:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2019-11-16 00:11:08,859 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 173 transitions. Word has length 45 [2019-11-16 00:11:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:08,860 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 173 transitions. [2019-11-16 00:11:08,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:11:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 173 transitions. [2019-11-16 00:11:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:11:08,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:08,860 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:08,861 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1530049574, now seen corresponding path program 1 times [2019-11-16 00:11:08,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:08,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615347212] [2019-11-16 00:11:08,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:08,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:08,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-16 00:11:08,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615347212] [2019-11-16 00:11:08,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:08,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:11:08,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091952990] [2019-11-16 00:11:08,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:11:08,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:08,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:11:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:11:08,950 INFO L87 Difference]: Start difference. First operand 143 states and 173 transitions. Second operand 8 states. [2019-11-16 00:11:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:09,284 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-11-16 00:11:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:11:09,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-16 00:11:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:09,285 INFO L225 Difference]: With dead ends: 86 [2019-11-16 00:11:09,285 INFO L226 Difference]: Without dead ends: 86 [2019-11-16 00:11:09,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:11:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-16 00:11:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-16 00:11:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-16 00:11:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-11-16 00:11:09,289 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 47 [2019-11-16 00:11:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:09,289 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-11-16 00:11:09,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:11:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-11-16 00:11:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:11:09,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:09,290 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, 1, 1] [2019-11-16 00:11:09,290 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1399451140, now seen corresponding path program 1 times [2019-11-16 00:11:09,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:09,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983045430] [2019-11-16 00:11:09,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:09,785 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-16 00:11:09,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983045430] [2019-11-16 00:11:09,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:09,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-16 00:11:09,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451743592] [2019-11-16 00:11:09,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:11:09,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:11:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:11:09,787 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 20 states. [2019-11-16 00:11:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:10,655 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-11-16 00:11:10,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:11:10,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2019-11-16 00:11:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:10,656 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:11:10,656 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:11:10,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:11:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:11:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2019-11-16 00:11:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-16 00:11:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-11-16 00:11:10,660 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 49 [2019-11-16 00:11:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:10,660 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-11-16 00:11:10,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:11:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-11-16 00:11:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:11:10,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:10,661 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, 1, 1] [2019-11-16 00:11:10,661 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1399451139, now seen corresponding path program 1 times [2019-11-16 00:11:10,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:10,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044523003] [2019-11-16 00:11:10,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:10,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:10,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:11,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044523003] [2019-11-16 00:11:11,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897188691] [2019-11-16 00:11:11,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:11:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-16 00:11:11,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:12,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:12,076 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-16 00:11:12,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:12,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,091 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-16 00:11:12,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:12,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:12,097 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-16 00:11:12,291 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-16 00:11:12,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:12,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,317 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-16 00:11:12,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:12,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:12,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:45 [2019-11-16 00:11:12,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 78 [2019-11-16 00:11:12,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:12,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:12,864 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-16 00:11:12,886 INFO L567 ElimStorePlain]: treesize reduction 18, result has 75.0 percent of original size [2019-11-16 00:11:12,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2019-11-16 00:11:12,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:12,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:12,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:12,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:21 [2019-11-16 00:11:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:13,040 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:13,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2019-11-16 00:11:13,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321557086] [2019-11-16 00:11:13,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-16 00:11:13,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-16 00:11:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2235, Unknown=0, NotChecked=0, Total=2352 [2019-11-16 00:11:13,042 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 49 states. [2019-11-16 00:11:14,834 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-16 00:11:15,110 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-11-16 00:11:15,447 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2019-11-16 00:11:15,671 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-11-16 00:11:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:16,822 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2019-11-16 00:11:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:11:16,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-11-16 00:11:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:16,823 INFO L225 Difference]: With dead ends: 116 [2019-11-16 00:11:16,823 INFO L226 Difference]: Without dead ends: 116 [2019-11-16 00:11:16,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=299, Invalid=4257, Unknown=0, NotChecked=0, Total=4556 [2019-11-16 00:11:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-16 00:11:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2019-11-16 00:11:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:11:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2019-11-16 00:11:16,829 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 49 [2019-11-16 00:11:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:16,830 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2019-11-16 00:11:16,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-16 00:11:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2019-11-16 00:11:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:11:16,831 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:16,831 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, 1, 1, 1] [2019-11-16 00:11:17,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:17,034 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash -433326188, now seen corresponding path program 1 times [2019-11-16 00:11:17,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:17,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163575579] [2019-11-16 00:11:17,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:17,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:17,293 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-16 00:11:17,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163575579] [2019-11-16 00:11:17,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:17,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-16 00:11:17,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543873288] [2019-11-16 00:11:17,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:11:17,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:11:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:11:17,295 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 16 states. [2019-11-16 00:11:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:17,928 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2019-11-16 00:11:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:11:17,929 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-16 00:11:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:17,930 INFO L225 Difference]: With dead ends: 149 [2019-11-16 00:11:17,930 INFO L226 Difference]: Without dead ends: 149 [2019-11-16 00:11:17,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:11:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-16 00:11:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 126. [2019-11-16 00:11:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:11:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2019-11-16 00:11:17,934 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 50 [2019-11-16 00:11:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:17,935 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2019-11-16 00:11:17,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:11:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2019-11-16 00:11:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:11:17,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:17,935 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, 1, 1, 1, 1] [2019-11-16 00:11:17,936 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:17,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:17,936 INFO L82 PathProgramCache]: Analyzing trace with hash -548209796, now seen corresponding path program 1 times [2019-11-16 00:11:17,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:17,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223959113] [2019-11-16 00:11:17,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:17,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:17,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:18,162 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-16 00:11:18,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223959113] [2019-11-16 00:11:18,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:18,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:11:18,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580483589] [2019-11-16 00:11:18,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:11:18,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:11:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:11:18,163 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 15 states. [2019-11-16 00:11:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:18,751 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-11-16 00:11:18,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:11:18,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-16 00:11:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:18,754 INFO L225 Difference]: With dead ends: 132 [2019-11-16 00:11:18,754 INFO L226 Difference]: Without dead ends: 132 [2019-11-16 00:11:18,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:11:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-16 00:11:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2019-11-16 00:11:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:11:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2019-11-16 00:11:18,758 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 51 [2019-11-16 00:11:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:18,758 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2019-11-16 00:11:18,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:11:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2019-11-16 00:11:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:11:18,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:18,759 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, 1, 1, 1, 1, 1] [2019-11-16 00:11:18,760 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 198724931, now seen corresponding path program 1 times [2019-11-16 00:11:18,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:18,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727894702] [2019-11-16 00:11:18,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:18,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:18,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:19,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727894702] [2019-11-16 00:11:19,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776070119] [2019-11-16 00:11:19,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:11:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:19,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-16 00:11:19,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:19,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:11:19,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:19,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:19,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:19,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-16 00:11:19,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:19,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:19,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:19,666 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 23 [2019-11-16 00:11:19,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:19,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:19,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:19,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:16 [2019-11-16 00:11:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:19,739 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:19,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 30 [2019-11-16 00:11:19,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511766759] [2019-11-16 00:11:19,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:11:19,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:11:19,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:11:19,741 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 31 states. [2019-11-16 00:11:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:21,088 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2019-11-16 00:11:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:11:21,089 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2019-11-16 00:11:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:21,090 INFO L225 Difference]: With dead ends: 131 [2019-11-16 00:11:21,090 INFO L226 Difference]: Without dead ends: 131 [2019-11-16 00:11:21,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:11:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-16 00:11:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2019-11-16 00:11:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:11:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2019-11-16 00:11:21,095 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 52 [2019-11-16 00:11:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:21,095 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2019-11-16 00:11:21,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:11:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2019-11-16 00:11:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:11:21,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:21,096 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, 1, 1, 1, 1, 1] [2019-11-16 00:11:21,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:21,300 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash 185365654, now seen corresponding path program 1 times [2019-11-16 00:11:21,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:21,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552849512] [2019-11-16 00:11:21,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:21,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:21,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,393 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-16 00:11:21,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552849512] [2019-11-16 00:11:21,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:21,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:11:21,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710089760] [2019-11-16 00:11:21,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:11:21,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:11:21,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:11:21,394 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand 7 states. [2019-11-16 00:11:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:21,624 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2019-11-16 00:11:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:11:21,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-16 00:11:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:21,625 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:11:21,625 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:11:21,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:11:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:11:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-16 00:11:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-16 00:11:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-11-16 00:11:21,629 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 52 [2019-11-16 00:11:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:21,630 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-11-16 00:11:21,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:11:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-11-16 00:11:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:11:21,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:21,631 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:21,631 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1451368127, now seen corresponding path program 1 times [2019-11-16 00:11:21,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:21,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336381364] [2019-11-16 00:11:21,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:21,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:21,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:21,939 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-16 00:11:21,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336381364] [2019-11-16 00:11:21,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:21,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-16 00:11:21,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003313969] [2019-11-16 00:11:21,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:11:21,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:11:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:11:21,940 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 18 states. [2019-11-16 00:11:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:22,692 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2019-11-16 00:11:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:11:22,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-11-16 00:11:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:22,693 INFO L225 Difference]: With dead ends: 128 [2019-11-16 00:11:22,693 INFO L226 Difference]: Without dead ends: 128 [2019-11-16 00:11:22,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:11:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-16 00:11:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2019-11-16 00:11:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-16 00:11:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2019-11-16 00:11:22,697 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 53 [2019-11-16 00:11:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:22,698 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2019-11-16 00:11:22,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:11:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2019-11-16 00:11:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:11:22,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:22,699 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:22,699 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1996102822, now seen corresponding path program 1 times [2019-11-16 00:11:22,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:22,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591199117] [2019-11-16 00:11:22,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:22,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:22,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:22,871 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-16 00:11:22,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591199117] [2019-11-16 00:11:22,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:22,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:11:22,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050417686] [2019-11-16 00:11:22,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:11:22,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:11:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:11:22,874 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 11 states. [2019-11-16 00:11:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:23,316 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2019-11-16 00:11:23,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:11:23,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-11-16 00:11:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:23,317 INFO L225 Difference]: With dead ends: 124 [2019-11-16 00:11:23,318 INFO L226 Difference]: Without dead ends: 124 [2019-11-16 00:11:23,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:11:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-16 00:11:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-11-16 00:11:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:11:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2019-11-16 00:11:23,322 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 54 [2019-11-16 00:11:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:23,322 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2019-11-16 00:11:23,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:11:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2019-11-16 00:11:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:11:23,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:23,324 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:23,324 INFO L410 AbstractCegarLoop]: === Iteration 27 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1749645443, now seen corresponding path program 1 times [2019-11-16 00:11:23,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:23,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435182701] [2019-11-16 00:11:23,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:23,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:23,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:23,798 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-16 00:11:23,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435182701] [2019-11-16 00:11:23,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:23,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-16 00:11:23,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512746474] [2019-11-16 00:11:23,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-16 00:11:23,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:11:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:11:23,800 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand 23 states. [2019-11-16 00:11:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:24,903 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2019-11-16 00:11:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:11:24,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2019-11-16 00:11:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:24,905 INFO L225 Difference]: With dead ends: 144 [2019-11-16 00:11:24,905 INFO L226 Difference]: Without dead ends: 144 [2019-11-16 00:11:24,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:11:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-16 00:11:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2019-11-16 00:11:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-16 00:11:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2019-11-16 00:11:24,909 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 55 [2019-11-16 00:11:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:24,910 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2019-11-16 00:11:24,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-16 00:11:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2019-11-16 00:11:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:11:24,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:24,911 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:24,911 INFO L410 AbstractCegarLoop]: === Iteration 28 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1749645444, now seen corresponding path program 1 times [2019-11-16 00:11:24,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:24,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473051313] [2019-11-16 00:11:24,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:24,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:24,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:25,266 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-16 00:11:25,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473051313] [2019-11-16 00:11:25,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:25,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-16 00:11:25,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254808914] [2019-11-16 00:11:25,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:11:25,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:25,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:11:25,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:11:25,267 INFO L87 Difference]: Start difference. First operand 131 states and 150 transitions. Second operand 16 states. [2019-11-16 00:11:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:25,920 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2019-11-16 00:11:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:11:25,921 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-11-16 00:11:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:25,922 INFO L225 Difference]: With dead ends: 131 [2019-11-16 00:11:25,922 INFO L226 Difference]: Without dead ends: 131 [2019-11-16 00:11:25,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:11:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-16 00:11:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-16 00:11:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-16 00:11:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2019-11-16 00:11:25,926 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 55 [2019-11-16 00:11:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:25,926 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2019-11-16 00:11:25,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:11:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2019-11-16 00:11:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:11:25,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:25,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:25,928 INFO L410 AbstractCegarLoop]: === Iteration 29 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -35604563, now seen corresponding path program 1 times [2019-11-16 00:11:25,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:25,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321744505] [2019-11-16 00:11:25,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:25,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:25,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:27,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321744505] [2019-11-16 00:11:27,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439673546] [2019-11-16 00:11:27,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:11:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:27,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 94 conjunts are in the unsatisfiable core [2019-11-16 00:11:27,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:27,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:11:27,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:27,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:27,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:11:27,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:27,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:27,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:27,800 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-11-16 00:11:27,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:27,962 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 58 treesize of output 39 [2019-11-16 00:11:27,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:27,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:27,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:27,983 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 40 treesize of output 33 [2019-11-16 00:11:27,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:27,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:27,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:27,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2019-11-16 00:11:28,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:28,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:28,100 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 107 [2019-11-16 00:11:28,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:28,150 INFO L567 ElimStorePlain]: treesize reduction 62, result has 54.4 percent of original size [2019-11-16 00:11:28,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:28,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:28,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:28,165 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 50 [2019-11-16 00:11:28,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:28,211 INFO L567 ElimStorePlain]: treesize reduction 18, result has 79.5 percent of original size [2019-11-16 00:11:28,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:28,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:112 [2019-11-16 00:11:29,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,445 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 9 case distinctions, treesize of input 278 treesize of output 250 [2019-11-16 00:11:29,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,466 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:29,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 292 treesize of output 274 [2019-11-16 00:11:29,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,576 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:29,698 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2019-11-16 00:11:29,698 INFO L567 ElimStorePlain]: treesize reduction 186, result has 60.5 percent of original size [2019-11-16 00:11:29,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 172 [2019-11-16 00:11:29,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,854 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-16 00:11:29,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 151 treesize of output 146 [2019-11-16 00:11:29,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:29,961 INFO L496 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:30,245 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 59 [2019-11-16 00:11:30,246 INFO L567 ElimStorePlain]: treesize reduction 1199, result has 8.3 percent of original size [2019-11-16 00:11:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2019-11-16 00:11:30,249 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:571, output treesize:163 [2019-11-16 00:11:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:11:30,592 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:30,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2019-11-16 00:11:30,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80666533] [2019-11-16 00:11:30,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-16 00:11:30,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:30,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-16 00:11:30,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2725, Unknown=0, NotChecked=0, Total=2862 [2019-11-16 00:11:30,594 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 54 states. [2019-11-16 00:11:31,896 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-11-16 00:11:32,184 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-11-16 00:11:32,820 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-11-16 00:11:33,097 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-11-16 00:11:33,383 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-11-16 00:11:33,657 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2019-11-16 00:11:33,939 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-11-16 00:11:34,347 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 110 [2019-11-16 00:11:34,950 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 134 [2019-11-16 00:11:35,466 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 131 [2019-11-16 00:11:36,010 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2019-11-16 00:11:36,278 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-11-16 00:11:36,626 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2019-11-16 00:11:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:37,438 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2019-11-16 00:11:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:11:37,438 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 58 [2019-11-16 00:11:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:37,439 INFO L225 Difference]: With dead ends: 132 [2019-11-16 00:11:37,439 INFO L226 Difference]: Without dead ends: 132 [2019-11-16 00:11:37,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=411, Invalid=5595, Unknown=0, NotChecked=0, Total=6006 [2019-11-16 00:11:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-16 00:11:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-11-16 00:11:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-16 00:11:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2019-11-16 00:11:37,447 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 58 [2019-11-16 00:11:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:37,448 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2019-11-16 00:11:37,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-16 00:11:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2019-11-16 00:11:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:11:37,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:37,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:37,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:37,653 INFO L410 AbstractCegarLoop]: === Iteration 30 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash -35604564, now seen corresponding path program 1 times [2019-11-16 00:11:37,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:37,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714285482] [2019-11-16 00:11:37,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:37,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:37,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:38,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714285482] [2019-11-16 00:11:38,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372021936] [2019-11-16 00:11:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 88 conjunts are in the unsatisfiable core [2019-11-16 00:11:38,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:39,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:11:39,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:39,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:39,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:39,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-16 00:11:39,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:39,336 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 21 treesize of output 20 [2019-11-16 00:11:39,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:39,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:39,355 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-16 00:11:39,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-16 00:11:39,451 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:39,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:39,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:39,468 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2019-11-16 00:11:39,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:39,502 INFO L567 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2019-11-16 00:11:39,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:39,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2019-11-16 00:11:40,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2019-11-16 00:11:40,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:40,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:40,577 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-16 00:11:40,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:107, output treesize:80 [2019-11-16 00:11:40,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:41,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:41,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:41,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:41,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:41,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:41,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:41,254 INFO L341 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2019-11-16 00:11:41,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 42 [2019-11-16 00:11:41,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:41,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:41,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:41,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:41,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:99, output treesize:3 [2019-11-16 00:11:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:11:41,297 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:41,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 54 [2019-11-16 00:11:41,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126521590] [2019-11-16 00:11:41,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-16 00:11:41,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-16 00:11:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2826, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:11:41,300 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand 55 states. [2019-11-16 00:11:43,532 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-11-16 00:11:43,786 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 108 [2019-11-16 00:11:44,099 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 108 [2019-11-16 00:11:44,357 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2019-11-16 00:11:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:45,658 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-11-16 00:11:45,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:11:45,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 58 [2019-11-16 00:11:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:45,659 INFO L225 Difference]: With dead ends: 131 [2019-11-16 00:11:45,660 INFO L226 Difference]: Without dead ends: 131 [2019-11-16 00:11:45,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=446, Invalid=6196, Unknown=0, NotChecked=0, Total=6642 [2019-11-16 00:11:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-16 00:11:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-16 00:11:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-16 00:11:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2019-11-16 00:11:45,666 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 58 [2019-11-16 00:11:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:45,666 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-11-16 00:11:45,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-16 00:11:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2019-11-16 00:11:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:11:45,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:45,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:45,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:45,871 INFO L410 AbstractCegarLoop]: === Iteration 31 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:45,871 INFO L82 PathProgramCache]: Analyzing trace with hash -390349556, now seen corresponding path program 1 times [2019-11-16 00:11:45,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:45,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317647641] [2019-11-16 00:11:45,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:45,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:45,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:45,980 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-16 00:11:45,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317647641] [2019-11-16 00:11:45,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:45,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:11:45,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342029786] [2019-11-16 00:11:45,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:11:45,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:11:45,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:11:45,983 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 8 states. [2019-11-16 00:11:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:46,259 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2019-11-16 00:11:46,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:11:46,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-16 00:11:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:46,261 INFO L225 Difference]: With dead ends: 129 [2019-11-16 00:11:46,261 INFO L226 Difference]: Without dead ends: 129 [2019-11-16 00:11:46,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:11:46,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-16 00:11:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-11-16 00:11:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-16 00:11:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-11-16 00:11:46,265 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 58 [2019-11-16 00:11:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:46,265 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-11-16 00:11:46,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:11:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-11-16 00:11:46,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:11:46,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:46,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:46,266 INFO L410 AbstractCegarLoop]: === Iteration 32 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:46,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1463766642, now seen corresponding path program 1 times [2019-11-16 00:11:46,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:46,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645025643] [2019-11-16 00:11:46,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:46,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:46,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:11:46,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645025643] [2019-11-16 00:11:46,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240887669] [2019-11-16 00:11:46,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:46,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:11:46,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:11:46,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:46,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-16 00:11:46,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335000387] [2019-11-16 00:11:46,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:11:46,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:11:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:11:46,630 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 10 states. [2019-11-16 00:11:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:46,936 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2019-11-16 00:11:46,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:11:46,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-11-16 00:11:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:46,937 INFO L225 Difference]: With dead ends: 137 [2019-11-16 00:11:46,937 INFO L226 Difference]: Without dead ends: 137 [2019-11-16 00:11:46,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:11:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-16 00:11:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-11-16 00:11:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-16 00:11:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2019-11-16 00:11:46,941 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 60 [2019-11-16 00:11:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:46,941 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2019-11-16 00:11:46,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:11:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2019-11-16 00:11:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:11:46,942 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:46,942 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:47,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:47,149 INFO L410 AbstractCegarLoop]: === Iteration 33 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1872049099, now seen corresponding path program 1 times [2019-11-16 00:11:47,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:47,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622098169] [2019-11-16 00:11:47,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:47,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:47,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:48,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622098169] [2019-11-16 00:11:48,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067338001] [2019-11-16 00:11:48,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:48,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-16 00:11:48,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:48,743 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:48,743 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-16 00:11:48,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:48,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:48,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:48,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-16 00:11:48,798 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 11 treesize of output 7 [2019-11-16 00:11:48,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:48,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:48,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:48,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-16 00:11:49,412 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 29 treesize of output 21 [2019-11-16 00:11:49,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:49,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:49,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:49,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:17 [2019-11-16 00:11:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:49,512 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:49,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 56 [2019-11-16 00:11:49,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001162755] [2019-11-16 00:11:49,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-16 00:11:49,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:49,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-16 00:11:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2900, Unknown=0, NotChecked=0, Total=3080 [2019-11-16 00:11:49,514 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand 56 states. [2019-11-16 00:11:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:52,202 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-11-16 00:11:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:11:52,203 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 61 [2019-11-16 00:11:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:52,203 INFO L225 Difference]: With dead ends: 108 [2019-11-16 00:11:52,203 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:11:52,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=566, Invalid=6744, Unknown=0, NotChecked=0, Total=7310 [2019-11-16 00:11:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:11:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-16 00:11:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-16 00:11:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-11-16 00:11:52,209 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 61 [2019-11-16 00:11:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:52,209 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-11-16 00:11:52,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-16 00:11:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-11-16 00:11:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:11:52,210 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:52,210 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:52,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:52,411 INFO L410 AbstractCegarLoop]: === Iteration 34 === [dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash -250262701, now seen corresponding path program 1 times [2019-11-16 00:11:52,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:52,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097856650] [2019-11-16 00:11:52,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:52,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:52,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:53,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097856650] [2019-11-16 00:11:53,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475228725] [2019-11-16 00:11:53,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:53,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-16 00:11:53,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:54,377 WARN L191 SmtUtils]: Spent 743.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-16 00:11:55,642 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 24 [2019-11-16 00:12:00,359 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:12:00,504 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-16 00:12:00,504 INFO L341 Elim1Store]: treesize reduction 103, result has 50.7 percent of original size [2019-11-16 00:12:00,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 161 [2019-11-16 00:12:00,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:00,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:00,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:00,783 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) 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.doElimOneRec(ElimStorePlain.java:256) 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) 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) [2019-11-16 00:12:00,787 INFO L168 Benchmark]: Toolchain (without parser) took 71753.47 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 735.6 MB). Free memory was 943.4 MB in the beginning and 1.3 GB in the end (delta: -355.9 MB). Peak memory consumption was 379.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,788 INFO L168 Benchmark]: CDTParser took 0.18 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-16 00:12:00,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,788 INFO L168 Benchmark]: Boogie Preprocessor took 65.21 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-16 00:12:00,789 INFO L168 Benchmark]: RCFGBuilder took 833.72 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: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,789 INFO L168 Benchmark]: TraceAbstraction took 70317.92 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 606.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.4 MB). Peak memory consumption was 337.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,791 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 533.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.21 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 833.72 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: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70317.92 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 606.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.4 MB). Peak memory consumption was 337.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) 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-16 00:12:02,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:02,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:02,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:02,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:02,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:02,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:02,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:02,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:02,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:02,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:02,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:02,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:02,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:02,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:02,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:02,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:02,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:02,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:02,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:02,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:02,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:02,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:02,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:02,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:02,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:02,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:02,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:02,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:02,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:02,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:02,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:02,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:02,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:02,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:02,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:02,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:02,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:02,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:02,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:02,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:02,903 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:12:02,917 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:02,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:02,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:02,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:02,919 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:02,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:02,920 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:12:02,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:12:02,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:12:02,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:12:02,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:02,921 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:12:02,921 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:12:02,921 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:12:02,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:12:02,922 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:12:02,922 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:12:02,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:12:02,922 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:02,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:02,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:02,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:12:02,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:12:02,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:12:02,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:02,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:12:02,924 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:12:02,924 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:12:02,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:12:02,925 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_0830507f-a29c-4a42-b153-9720644f4726/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 -> 1a84b349ed554162d37455efc2adb7bf93e2048b [2019-11-16 00:12:02,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:02,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:02,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:02,975 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:02,976 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:02,976 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2019-11-16 00:12:03,028 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/c704c41d9/4d5a44caf58a4c6d96a32720b7066099/FLAG20b915d85 [2019-11-16 00:12:03,545 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:03,547 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2019-11-16 00:12:03,565 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/c704c41d9/4d5a44caf58a4c6d96a32720b7066099/FLAG20b915d85 [2019-11-16 00:12:03,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/bin/uautomizer/data/c704c41d9/4d5a44caf58a4c6d96a32720b7066099 [2019-11-16 00:12:04,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:04,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:12:04,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:04,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:04,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:04,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:03" (1/1) ... [2019-11-16 00:12:04,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f23fcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04, skipping insertion in model container [2019-11-16 00:12:04,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:03" (1/1) ... [2019-11-16 00:12:04,018 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:04,055 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:04,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:04,520 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:04,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:04,630 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:04,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04 WrapperNode [2019-11-16 00:12:04,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:04,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:04,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:04,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:04,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:04,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:04,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:04,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:04,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:12:04,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:12:04,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:04,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:12:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:12:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:12:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:12:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-16 00:12:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2019-11-16 00:12:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:12:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:12:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:12:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:12:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:12:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:12:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:12:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:12:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:12:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:12:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:12:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:12:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:12:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:12:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:12:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:12:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:12:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:12:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:12:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:12:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:12:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:12:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:12:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:12:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:12:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:12:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:12:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:12:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:12:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:12:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:12:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:12:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:12:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:12:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:12:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:12:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:12:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:12:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:12:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:12:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:12:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:12:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:12:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:12:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:12:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:12:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:12:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:12:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:12:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:12:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:12:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:12:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:12:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:12:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:12:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:12:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:12:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:12:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:12:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:12:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:12:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:12:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:12:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:12:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:12:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:12:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:12:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:12:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:12:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:12:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:12:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:12:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:12:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:12:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:12:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:12:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:12:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:12:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:12:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:12:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:12:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:12:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:12:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:12:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:12:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:12:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:12:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:12:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:12:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:12:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:12:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:12:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:12:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:12:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:12:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:12:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:12:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:12:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:12:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:12:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:12:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:12:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:12:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:12:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:12:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:12:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:12:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:12:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:12:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:12:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:12:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:12:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-16 00:12:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2019-11-16 00:12:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:12:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:12:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:12:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:12:04,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:12:04,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:12:04,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:04,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:12:05,314 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:12:05,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:05,671 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-16 00:12:05,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:05 BoogieIcfgContainer [2019-11-16 00:12:05,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:05,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:12:05,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:12:05,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:12:05,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:03" (1/3) ... [2019-11-16 00:12:05,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5e0695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:05, skipping insertion in model container [2019-11-16 00:12:05,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (2/3) ... [2019-11-16 00:12:05,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5e0695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:05, skipping insertion in model container [2019-11-16 00:12:05,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:05" (3/3) ... [2019-11-16 00:12:05,680 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2019-11-16 00:12:05,689 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:12:05,697 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-11-16 00:12:05,707 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-11-16 00:12:05,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:12:05,723 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:12:05,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:12:05,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:05,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:05,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:12:05,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:05,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:12:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-11-16 00:12:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:12:05,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:05,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:05,749 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_remove_lastErr13REQUIRES_VIOLATION, dll_circular_remove_lastErr14REQUIRES_VIOLATION, dll_circular_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr10ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr11REQUIRES_VIOLATION, dll_circular_remove_lastErr15ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr12REQUIRES_VIOLATION, dll_circular_remove_lastErr17ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr5REQUIRES_VIOLATION, dll_circular_remove_lastErr3REQUIRES_VIOLATION, dll_circular_remove_lastErr6REQUIRES_VIOLATION, dll_circular_remove_lastErr2REQUIRES_VIOLATION, dll_circular_remove_lastErr7REQUIRES_VIOLATION, dll_circular_remove_lastErr24REQUIRES_VIOLATION, dll_circular_remove_lastErr25REQUIRES_VIOLATION, dll_circular_remove_lastErr4REQUIRES_VIOLATION, dll_circular_remove_lastErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr21REQUIRES_VIOLATION, dll_circular_remove_lastErr22REQUIRES_VIOLATION, dll_circular_remove_lastErr23REQUIRES_VIOLATION, dll_circular_remove_lastErr18REQUIRES_VIOLATION, dll_circular_remove_lastErr1REQUIRES_VIOLATION, dll_circular_remove_lastErr16ASSERT_VIOLATIONMEMORY_FREE, dll_circular_remove_lastErr19REQUIRES_VIOLATION, dll_circular_remove_lastErr0REQUIRES_VIOLATION, dll_circular_remove_lastErr20REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:12:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1218522858, now seen corresponding path program 1 times [2019-11-16 00:12:05,764 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:12:05,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2003951980] [2019-11-16 00:12:05,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0830507f-a29c-4a42-b153-9720644f4726/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-16 00:12:05,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:12:05,991 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-16 00:12:05,996 INFO L168 Benchmark]: Toolchain (without parser) took 1993.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -79.0 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:05,996 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:05,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:05,998 INFO L168 Benchmark]: Boogie Preprocessor took 72.29 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-16 00:12:05,999 INFO L168 Benchmark]: RCFGBuilder took 968.13 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: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:05,999 INFO L168 Benchmark]: TraceAbstraction took 320.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:06,002 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.29 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 968.13 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: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 320.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 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...