./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 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_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/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 ef034042979fe1e524a3655a8992190a25335ff0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((sll_update_at_~head.offset (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (exists ((v_sll_update_at_~head.offset_64 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse0 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (or (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| sll_update_at_~head.base (store (select |#memory_$Pointer$.base| sll_update_at_~head.base) sll_update_at_~head.offset v_DerPreprocessor_16)) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1)) (not (= (bvadd (select |#valid| (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_sll_update_at_~head.offset_64 v_DerPreprocessor_15))) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1))))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 10:28:08,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:28:08,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:28:08,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:28:08,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:28:08,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:28:08,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:28:08,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:28:08,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:28:08,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:28:08,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:28:08,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:28:08,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:28:08,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:28:08,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:28:08,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:28:08,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:28:08,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:28:08,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:28:08,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:28:08,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:28:08,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:28:08,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:28:08,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:28:08,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:28:08,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:28:08,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:28:08,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:28:08,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:28:08,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:28:08,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:28:08,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:28:08,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:28:08,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:28:08,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:28:08,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:28:08,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:28:08,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:28:08,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:28:08,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:28:08,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:28:08,999 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 10:28:09,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:28:09,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:28:09,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:28:09,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:28:09,022 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:28:09,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:28:09,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:28:09,023 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 10:28:09,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:28:09,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:28:09,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:28:09,025 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 10:28:09,026 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 10:28:09,026 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 10:28:09,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:28:09,027 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:28:09,027 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:28:09,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:28:09,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:28:09,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:28:09,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:28:09,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:28:09,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:28:09,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:28:09,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:28:09,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:28:09,030 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 10:28:09,030 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:28:09,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:28:09,031 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_bbec4e43-62b9-4bbb-9427-f6979321949c/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2019-11-20 10:28:09,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:28:09,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:28:09,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:28:09,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:28:09,216 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:28:09,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-11-20 10:28:09,281 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/data/637636634/c2051cd4c7ac44e6bb20cf0ec79b295d/FLAG73fb9d2ac [2019-11-20 10:28:09,730 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:28:09,732 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-11-20 10:28:09,747 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/data/637636634/c2051cd4c7ac44e6bb20cf0ec79b295d/FLAG73fb9d2ac [2019-11-20 10:28:10,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/data/637636634/c2051cd4c7ac44e6bb20cf0ec79b295d [2019-11-20 10:28:10,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:28:10,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 10:28:10,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:28:10,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:28:10,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:28:10,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346082e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10, skipping insertion in model container [2019-11-20 10:28:10,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,055 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:28:10,122 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:28:10,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:28:10,613 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:28:10,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:28:10,727 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:28:10,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10 WrapperNode [2019-11-20 10:28:10,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:28:10,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:28:10,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:28:10,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:28:10,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... [2019-11-20 10:28:10,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:28:10,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:28:10,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:28:10,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:28:10,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/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-20 10:28:10,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 10:28:10,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:28:10,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 10:28:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 10:28:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 10:28:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-20 10:28:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-20 10:28:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-11-20 10:28:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-11-20 10:28:10,891 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-11-20 10:28:10,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 10:28:10,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 10:28:10,891 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 10:28:10,891 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 10:28:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 10:28:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 10:28:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 10:28:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 10:28:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 10:28:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 10:28:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 10:28:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 10:28:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 10:28:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 10:28:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 10:28:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 10:28:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 10:28:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 10:28:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 10:28:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 10:28:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 10:28:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 10:28:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 10:28:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 10:28:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 10:28:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 10:28:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 10:28:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 10:28:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 10:28:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 10:28:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 10:28:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 10:28:10,903 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 10:28:10,903 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 10:28:10,903 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 10:28:10,903 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 10:28:10,903 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 10:28:10,903 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 10:28:10,903 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 10:28:10,904 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 10:28:10,904 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 10:28:10,904 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 10:28:10,904 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 10:28:10,904 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 10:28:10,904 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 10:28:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 10:28:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 10:28:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 10:28:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-20 10:28:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:28:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:28:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 10:28:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-20 10:28:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-11-20 10:28:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:28:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:28:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-11-20 10:28:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 10:28:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-11-20 10:28:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 10:28:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 10:28:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:28:11,319 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 10:28:11,531 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:28:11,531 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-20 10:28:11,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:28:11 BoogieIcfgContainer [2019-11-20 10:28:11,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:28:11,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:28:11,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:28:11,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:28:11,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:28:10" (1/3) ... [2019-11-20 10:28:11,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc39a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:28:11, skipping insertion in model container [2019-11-20 10:28:11,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:28:10" (2/3) ... [2019-11-20 10:28:11,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc39a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:28:11, skipping insertion in model container [2019-11-20 10:28:11,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:28:11" (3/3) ... [2019-11-20 10:28:11,539 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2019-11-20 10:28:11,548 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:28:11,554 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-20 10:28:11,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-20 10:28:11,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:28:11,582 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 10:28:11,582 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:28:11,582 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:28:11,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:28:11,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:28:11,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:28:11,583 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:28:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-20 10:28:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 10:28:11,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:11,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:11,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:11,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1770400427, now seen corresponding path program 1 times [2019-11-20 10:28:11,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:11,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2008374480] [2019-11-20 10:28:11,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/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-20 10:28:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:11,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:28:11,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:12,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:12,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:12,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:12,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:12,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 10:28:12,021 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-20 10:28:12,022 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:12,037 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-20 10:28:12,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2008374480] [2019-11-20 10:28:12,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:12,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 10:28:12,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72909075] [2019-11-20 10:28:12,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:28:12,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:12,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:28:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:28:12,066 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-11-20 10:28:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:12,238 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-11-20 10:28:12,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:28:12,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 10:28:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:12,252 INFO L225 Difference]: With dead ends: 85 [2019-11-20 10:28:12,253 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 10:28:12,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:28:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 10:28:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-20 10:28:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 10:28:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-20 10:28:12,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 13 [2019-11-20 10:28:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:12,320 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-20 10:28:12,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:28:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-20 10:28:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 10:28:12,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:12,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:12,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:12,526 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1770400428, now seen corresponding path program 1 times [2019-11-20 10:28:12,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:12,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1595869224] [2019-11-20 10:28:12,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:12,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:28:12,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:12,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:12,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:12,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:12,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:12,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 10:28:12,831 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-20 10:28:12,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:12,895 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-20 10:28:12,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1595869224] [2019-11-20 10:28:12,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:12,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 10:28:12,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649336934] [2019-11-20 10:28:12,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:28:12,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:28:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:28:12,899 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 4 states. [2019-11-20 10:28:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:13,092 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-11-20 10:28:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:28:13,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-20 10:28:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:13,098 INFO L225 Difference]: With dead ends: 76 [2019-11-20 10:28:13,099 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 10:28:13,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:28:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 10:28:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-20 10:28:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 10:28:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-20 10:28:13,121 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 13 [2019-11-20 10:28:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:13,121 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-20 10:28:13,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:28:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-20 10:28:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 10:28:13,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:13,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:13,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:13,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1633216438, now seen corresponding path program 1 times [2019-11-20 10:28:13,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:13,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1527265622] [2019-11-20 10:28:13,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:13,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:28:13,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:13,625 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-20 10:28:13,626 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:13,728 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-20 10:28:13,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1527265622] [2019-11-20 10:28:13,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:13,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 10:28:13,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617928764] [2019-11-20 10:28:13,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:28:13,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:13,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:28:13,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:28:13,730 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 7 states. [2019-11-20 10:28:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:13,836 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-11-20 10:28:13,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:28:13,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 10:28:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:13,840 INFO L225 Difference]: With dead ends: 87 [2019-11-20 10:28:13,840 INFO L226 Difference]: Without dead ends: 84 [2019-11-20 10:28:13,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:28:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-20 10:28:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2019-11-20 10:28:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 10:28:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-20 10:28:13,855 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 18 [2019-11-20 10:28:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:13,856 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-20 10:28:13,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:28:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-20 10:28:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 10:28:13,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:13,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:14,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:14,063 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1350272738, now seen corresponding path program 1 times [2019-11-20 10:28:14,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:14,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1194445053] [2019-11-20 10:28:14,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:14,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:28:14,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:14,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:14,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:14,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:14,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:14,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 10:28:14,356 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-20 10:28:14,356 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:14,424 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-20 10:28:14,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1194445053] [2019-11-20 10:28:14,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:14,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 10:28:14,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784859697] [2019-11-20 10:28:14,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:28:14,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:14,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:28:14,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:28:14,426 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-11-20 10:28:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:14,675 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-20 10:28:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:28:14,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-20 10:28:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:14,678 INFO L225 Difference]: With dead ends: 77 [2019-11-20 10:28:14,679 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 10:28:14,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:28:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 10:28:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-11-20 10:28:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 10:28:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-20 10:28:14,695 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2019-11-20 10:28:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:14,695 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-20 10:28:14,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:28:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-20 10:28:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 10:28:14,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:14,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:14,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:14,900 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:14,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1350272739, now seen corresponding path program 1 times [2019-11-20 10:28:14,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:14,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [851863722] [2019-11-20 10:28:14,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:15,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 10:28:15,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:15,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:15,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:15,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:15,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:15,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 10:28:15,235 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-20 10:28:15,235 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:15,712 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-20 10:28:15,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [851863722] [2019-11-20 10:28:15,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:15,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 10:28:15,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209719298] [2019-11-20 10:28:15,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:28:15,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:28:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:28:15,714 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 10 states. [2019-11-20 10:28:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:16,286 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-11-20 10:28:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:28:16,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 10:28:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:16,288 INFO L225 Difference]: With dead ends: 76 [2019-11-20 10:28:16,288 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 10:28:16,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:28:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 10:28:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-20 10:28:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 10:28:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-20 10:28:16,298 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2019-11-20 10:28:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:16,299 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-20 10:28:16,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:28:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-20 10:28:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 10:28:16,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:16,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:16,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:16,501 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash 318935620, now seen corresponding path program 1 times [2019-11-20 10:28:16,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:16,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [447304924] [2019-11-20 10:28:16,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:16,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:28:16,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:16,790 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:16,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [447304924] [2019-11-20 10:28:16,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:28:16,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-20 10:28:16,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192446108] [2019-11-20 10:28:16,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:28:16,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:16,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:28:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:28:16,963 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 9 states. [2019-11-20 10:28:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:17,158 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2019-11-20 10:28:17,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:28:17,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-20 10:28:17,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:17,161 INFO L225 Difference]: With dead ends: 89 [2019-11-20 10:28:17,161 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 10:28:17,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:28:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 10:28:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2019-11-20 10:28:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-20 10:28:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-11-20 10:28:17,177 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 31 [2019-11-20 10:28:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:17,178 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-11-20 10:28:17,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:28:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-11-20 10:28:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 10:28:17,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:17,185 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:17,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:17,388 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash 829070986, now seen corresponding path program 2 times [2019-11-20 10:28:17,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:17,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1410720745] [2019-11-20 10:28:17,389 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:17,662 ERROR L271 FreeRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-20 10:28:17,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357033541] [2019-11-20 10:28:17,663 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/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-20 10:28:17,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:28:17,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:28:17,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:28:17,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:17,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:17,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:17,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:17,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:17,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 10:28:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:28:17,990 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:28:18,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1410720745] [2019-11-20 10:28:18,216 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 10:28:18,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357033541] [2019-11-20 10:28:18,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:18,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 11 [2019-11-20 10:28:18,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483530888] [2019-11-20 10:28:18,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:28:18,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:28:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:28:18,221 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 12 states. [2019-11-20 10:28:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:18,874 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-11-20 10:28:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:28:18,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-11-20 10:28:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:18,876 INFO L225 Difference]: With dead ends: 86 [2019-11-20 10:28:18,877 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 10:28:18,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-20 10:28:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 10:28:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-20 10:28:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 10:28:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-20 10:28:18,884 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 44 [2019-11-20 10:28:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:18,885 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-20 10:28:18,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:28:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-20 10:28:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 10:28:18,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:18,887 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:19,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:28:19,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 829070987, now seen corresponding path program 1 times [2019-11-20 10:28:19,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:19,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1919450521] [2019-11-20 10:28:19,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:19,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 10:28:19,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:19,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:19,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:19,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:19,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:19,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 10:28:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:28:19,650 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:28:20,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1919450521] [2019-11-20 10:28:20,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:20,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 21 [2019-11-20 10:28:20,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710311794] [2019-11-20 10:28:20,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:28:20,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:28:20,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:28:20,930 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 22 states. [2019-11-20 10:28:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:22,523 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-11-20 10:28:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 10:28:22,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-11-20 10:28:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:22,525 INFO L225 Difference]: With dead ends: 87 [2019-11-20 10:28:22,525 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 10:28:22,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-20 10:28:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 10:28:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-11-20 10:28:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 10:28:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-11-20 10:28:22,533 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 44 [2019-11-20 10:28:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:22,538 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-11-20 10:28:22,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:28:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-11-20 10:28:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 10:28:22,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:22,545 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:22,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:22,749 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:22,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:22,750 INFO L82 PathProgramCache]: Analyzing trace with hash -505972101, now seen corresponding path program 1 times [2019-11-20 10:28:22,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:22,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1452619814] [2019-11-20 10:28:22,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:22,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:28:22,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:28:23,015 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:28:23,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1452619814] [2019-11-20 10:28:23,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:23,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:28:23,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171991739] [2019-11-20 10:28:23,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:28:23,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:28:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:28:23,080 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2019-11-20 10:28:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:23,159 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2019-11-20 10:28:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:28:23,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-20 10:28:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:23,162 INFO L225 Difference]: With dead ends: 93 [2019-11-20 10:28:23,162 INFO L226 Difference]: Without dead ends: 93 [2019-11-20 10:28:23,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:28:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-20 10:28:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-20 10:28:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 10:28:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-11-20 10:28:23,170 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 46 [2019-11-20 10:28:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:23,170 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-11-20 10:28:23,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:28:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-11-20 10:28:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 10:28:23,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:23,172 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:23,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:23,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:23,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1501553928, now seen corresponding path program 1 times [2019-11-20 10:28:23,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:23,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [514830836] [2019-11-20 10:28:23,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:23,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:28:23,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:28:23,677 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:28:23,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [514830836] [2019-11-20 10:28:23,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:28:23,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 10:28:23,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52298552] [2019-11-20 10:28:23,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:28:23,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:23,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:28:23,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:28:23,740 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 8 states. [2019-11-20 10:28:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:23,808 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-20 10:28:23,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:28:23,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-20 10:28:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:23,811 INFO L225 Difference]: With dead ends: 98 [2019-11-20 10:28:23,811 INFO L226 Difference]: Without dead ends: 98 [2019-11-20 10:28:23,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:28:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-20 10:28:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-20 10:28:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-20 10:28:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-20 10:28:23,826 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 47 [2019-11-20 10:28:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:23,826 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-20 10:28:23,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:28:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-20 10:28:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 10:28:23,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:23,833 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:24,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:24,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1103013084, now seen corresponding path program 1 times [2019-11-20 10:28:24,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:24,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1726614020] [2019-11-20 10:28:24,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:24,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-20 10:28:24,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:24,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:24,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:24,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:24,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:24,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 10:28:24,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:24,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 10:28:24,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:24,546 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-20 10:28:24,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:24,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2019-11-20 10:28:24,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 10:28:24,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:24,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:24,603 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-20 10:28:24,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-20 10:28:24,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 10:28:24,745 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-20 10:28:24,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:24,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:24,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-11-20 10:28:25,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 10:28:25,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:25,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:25,039 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-20 10:28:25,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2019-11-20 10:28:25,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 10:28:25,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:25,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:25,227 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-20 10:28:25,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2019-11-20 10:28:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 10:28:25,334 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:25,605 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-20 10:28:25,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:25,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:25,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:14 [2019-11-20 10:28:25,820 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-20 10:28:25,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:25,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:25,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:34 [2019-11-20 10:28:28,318 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 10:28:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 10:28:28,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726614020] [2019-11-20 10:28:28,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:28:28,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 33 [2019-11-20 10:28:28,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586887679] [2019-11-20 10:28:28,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-20 10:28:28,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:28:28,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-20 10:28:28,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1028, Unknown=1, NotChecked=0, Total=1122 [2019-11-20 10:28:28,915 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 34 states. [2019-11-20 10:28:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:28:37,889 INFO L93 Difference]: Finished difference Result 171 states and 191 transitions. [2019-11-20 10:28:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-20 10:28:37,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 55 [2019-11-20 10:28:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:28:37,895 INFO L225 Difference]: With dead ends: 171 [2019-11-20 10:28:37,895 INFO L226 Difference]: Without dead ends: 171 [2019-11-20 10:28:37,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=309, Invalid=2659, Unknown=2, NotChecked=0, Total=2970 [2019-11-20 10:28:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-20 10:28:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 113. [2019-11-20 10:28:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-20 10:28:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-20 10:28:37,906 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 55 [2019-11-20 10:28:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:28:37,906 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-20 10:28:37,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-20 10:28:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-20 10:28:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 10:28:37,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:28:37,908 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:28:38,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:38,114 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:28:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:28:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1103013083, now seen corresponding path program 1 times [2019-11-20 10:28:38,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:28:38,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [942077133] [2019-11-20 10:28:38,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:28:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:38,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-20 10:28:38,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:28:38,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:38,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:38,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:28:38,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:38,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,544 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 10:28:38,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:38,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 10:28:38,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:38,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 10:28:38,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:38,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,731 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-20 10:28:38,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 10:28:38,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:38,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 10:28:38,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:38,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:28:38,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:43 [2019-11-20 10:28:39,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-20 10:28:39,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:39,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:39,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2019-11-20 10:28:39,229 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:39,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:39,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:39,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2019-11-20 10:28:39,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 10:28:39,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:39,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:39,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-20 10:28:39,666 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:39,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:39,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:39,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:49 [2019-11-20 10:28:39,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 10:28:39,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:39,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:39,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:28:39,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:39,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:39,933 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-20 10:28:39,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2019-11-20 10:28:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 10:28:40,120 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:28:41,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:28:41,254 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-20 10:28:41,261 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:41,266 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:41,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:41,319 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:41,328 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:41,331 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:41,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:41,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 10:28:41,350 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:145, output treesize:61 [2019-11-20 10:28:42,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:28:42,156 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-20 10:28:42,165 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:42,173 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:42,388 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 10:28:42,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:42,401 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:42,411 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 10:28:42,418 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:28:42,607 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 10:28:42,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:28:42,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 10:28:42,609 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:289, output treesize:233 [2019-11-20 10:28:43,188 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 10:28:44,221 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 10:28:45,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:28:49,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:28:49,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:49,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:49,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:49,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:28:59,500 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 10:28:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:29:04,671 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 10:29:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 10:29:25,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942077133] [2019-11-20 10:29:25,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:29:25,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2019-11-20 10:29:25,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243474961] [2019-11-20 10:29:25,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-20 10:29:25,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:29:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-20 10:29:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1680, Unknown=2, NotChecked=0, Total=1806 [2019-11-20 10:29:25,260 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 43 states. [2019-11-20 10:29:30,883 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_node_create_~temp~0.base) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| c_node_create_~temp~0.base (_ bv8 32))) (= (_ bv1 1) (select |c_#valid| c_node_create_~temp~0.base)) (= (bvadd (select |c_#length| c_node_create_~temp~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) c_node_create_~temp~0.offset) (forall ((v_sll_create_~head~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_sll_create_~head~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_node_create_~temp~0.base_104 (_ BitVec 32))) (let ((.cse0 (bvadd v_sll_create_~head~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (bvsle v_sll_create_~head~0.offset_BEFORE_CALL_2 .cse0)) (not (bvsle (_ bv0 32) v_sll_create_~head~0.offset_BEFORE_CALL_2)) (bvsle .cse0 (select (store |c_#length| v_node_create_~temp~0.base_104 (_ bv8 32)) v_sll_create_~head~0.base_BEFORE_CALL_4)) (not (= (select |c_#valid| v_node_create_~temp~0.base_104) (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (bvsle (bvadd v_sll_create_~head~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 (_ bv8 32)) v_sll_create_~head~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))))) is different from false [2019-11-20 10:29:39,530 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-20 10:29:50,149 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-20 10:29:59,259 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-11-20 10:30:01,245 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-20 10:30:03,684 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_node_create_~temp~0.base) (_ bv0 1)) (exists ((v_arrayElimCell_9 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (and (not (= v_arrayElimCell_9 v_main_~s~0.base_BEFORE_CALL_6)) (= (_ bv8 32) (select |c_#length| v_arrayElimCell_9)) (= (_ bv8 32) (select |c_#length| v_main_~s~0.base_BEFORE_CALL_6)))) (= |c_#length| (store |c_old(#length)| c_node_create_~temp~0.base (_ bv8 32))) (= (_ bv1 1) (select |c_#valid| c_node_create_~temp~0.base)) (= (bvadd (select |c_#length| c_node_create_~temp~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= (_ bv0 32) c_node_create_~temp~0.offset) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (forall ((v_sll_create_~head~0.base_BEFORE_CALL_4 (_ BitVec 32)) (v_sll_create_~head~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_node_create_~temp~0.base_104 (_ BitVec 32))) (let ((.cse0 (bvadd v_sll_create_~head~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (bvsle v_sll_create_~head~0.offset_BEFORE_CALL_2 .cse0)) (not (bvsle (_ bv0 32) v_sll_create_~head~0.offset_BEFORE_CALL_2)) (bvsle .cse0 (select (store |c_#length| v_node_create_~temp~0.base_104 (_ bv8 32)) v_sll_create_~head~0.base_BEFORE_CALL_4)) (not (= (select |c_#valid| v_node_create_~temp~0.base_104) (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (bvsle (bvadd v_sll_create_~head~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 (_ bv8 32)) v_sll_create_~head~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))))))) is different from false [2019-11-20 10:30:07,643 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-11-20 10:30:12,349 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-11-20 10:30:13,092 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2019-11-20 10:30:13,674 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-11-20 10:30:14,664 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 42 [2019-11-20 10:30:17,265 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 10:30:20,538 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 58 [2019-11-20 10:30:21,816 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 10:30:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:33,281 INFO L93 Difference]: Finished difference Result 209 states and 233 transitions. [2019-11-20 10:30:33,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 10:30:33,283 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2019-11-20 10:30:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:33,284 INFO L225 Difference]: With dead ends: 209 [2019-11-20 10:30:33,284 INFO L226 Difference]: Without dead ends: 209 [2019-11-20 10:30:33,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 78.4s TimeCoverageRelationStatistics Valid=400, Invalid=3892, Unknown=6, NotChecked=258, Total=4556 [2019-11-20 10:30:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-20 10:30:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 127. [2019-11-20 10:30:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 10:30:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2019-11-20 10:30:33,298 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 55 [2019-11-20 10:30:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:33,298 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2019-11-20 10:30:33,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-20 10:30:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2019-11-20 10:30:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 10:30:33,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:33,300 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:30:33,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:33,501 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:30:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 933617694, now seen corresponding path program 2 times [2019-11-20 10:30:33,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:30:33,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [537098632] [2019-11-20 10:30:33,502 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:33,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:30:33,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:30:33,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:30:33,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:30:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:30:33,919 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:30:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:30:34,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [537098632] [2019-11-20 10:30:34,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:30:34,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 10:30:34,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944190663] [2019-11-20 10:30:34,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:30:34,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:30:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:30:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:30:34,174 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand 12 states. [2019-11-20 10:30:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:34,584 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2019-11-20 10:30:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:30:34,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-11-20 10:30:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:34,586 INFO L225 Difference]: With dead ends: 128 [2019-11-20 10:30:34,586 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 10:30:34,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-20 10:30:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 10:30:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2019-11-20 10:30:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-20 10:30:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2019-11-20 10:30:34,593 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 58 [2019-11-20 10:30:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:34,593 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2019-11-20 10:30:34,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:30:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2019-11-20 10:30:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 10:30:34,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:34,595 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 10:30:34,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:34,801 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:30:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1348627470, now seen corresponding path program 1 times [2019-11-20 10:30:34,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:30:34,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [679262994] [2019-11-20 10:30:34,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:35,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:30:35,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:30:35,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:30:35,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:30:35,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:35,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:30:35,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 10:30:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:30:35,374 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:30:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:30:35,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [679262994] [2019-11-20 10:30:35,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:35,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 12 [2019-11-20 10:30:35,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098491022] [2019-11-20 10:30:35,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 10:30:35,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:30:35,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:30:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:30:35,552 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 13 states. [2019-11-20 10:30:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:36,283 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2019-11-20 10:30:36,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 10:30:36,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-11-20 10:30:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:36,284 INFO L225 Difference]: With dead ends: 137 [2019-11-20 10:30:36,284 INFO L226 Difference]: Without dead ends: 137 [2019-11-20 10:30:36,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-11-20 10:30:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-20 10:30:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2019-11-20 10:30:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-20 10:30:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-11-20 10:30:36,290 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 65 [2019-11-20 10:30:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:36,290 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-11-20 10:30:36,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 10:30:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-11-20 10:30:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 10:30:36,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:36,291 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 10:30:36,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:36,492 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:30:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1348627471, now seen corresponding path program 1 times [2019-11-20 10:30:36,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:30:36,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2032638657] [2019-11-20 10:30:36,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:36,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 10:30:36,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:30:36,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:30:36,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:30:36,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:36,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:30:36,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 10:30:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:30:37,323 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:30:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:30:38,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2032638657] [2019-11-20 10:30:38,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:38,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-20 10:30:38,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704401936] [2019-11-20 10:30:38,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 10:30:38,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:30:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 10:30:38,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-20 10:30:38,856 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 23 states. [2019-11-20 10:30:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:41,040 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2019-11-20 10:30:41,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 10:30:41,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-11-20 10:30:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:41,044 INFO L225 Difference]: With dead ends: 130 [2019-11-20 10:30:41,044 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 10:30:41,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-11-20 10:30:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 10:30:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2019-11-20 10:30:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-20 10:30:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2019-11-20 10:30:41,052 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 65 [2019-11-20 10:30:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:41,052 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2019-11-20 10:30:41,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 10:30:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2019-11-20 10:30:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:30:41,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:41,054 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:30:41,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:41,258 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:30:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash 100309578, now seen corresponding path program 3 times [2019-11-20 10:30:41,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:30:41,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1747104524] [2019-11-20 10:30:41,260 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:41,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 10:30:41,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:30:41,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:30:41,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:30:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 10:30:41,725 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:30:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 10:30:41,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1747104524] [2019-11-20 10:30:41,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:30:41,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-11-20 10:30:41,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715180825] [2019-11-20 10:30:41,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 10:30:41,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:30:41,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:30:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:30:41,910 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 13 states. [2019-11-20 10:30:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:42,058 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-11-20 10:30:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 10:30:42,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-11-20 10:30:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:42,061 INFO L225 Difference]: With dead ends: 95 [2019-11-20 10:30:42,061 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 10:30:42,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 10:30:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 10:30:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-11-20 10:30:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-20 10:30:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2019-11-20 10:30:42,066 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 66 [2019-11-20 10:30:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:42,066 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2019-11-20 10:30:42,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 10:30:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2019-11-20 10:30:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 10:30:42,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:42,068 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-20 10:30:42,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:42,268 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:30:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1838543078, now seen corresponding path program 1 times [2019-11-20 10:30:42,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:30:42,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1654463903] [2019-11-20 10:30:42,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:42,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:30:42,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:30:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:30:42,646 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:30:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:30:42,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1654463903] [2019-11-20 10:30:42,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:42,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 10:30:42,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582325167] [2019-11-20 10:30:42,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:30:42,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:30:42,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:30:42,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:30:42,719 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 8 states. [2019-11-20 10:30:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:42,794 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-11-20 10:30:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:30:42,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-20 10:30:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:42,796 INFO L225 Difference]: With dead ends: 101 [2019-11-20 10:30:42,796 INFO L226 Difference]: Without dead ends: 101 [2019-11-20 10:30:42,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:30:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-20 10:30:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-20 10:30:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 10:30:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-11-20 10:30:42,799 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 68 [2019-11-20 10:30:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:42,800 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-11-20 10:30:42,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:30:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-11-20 10:30:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 10:30:42,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:42,801 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 10:30:43,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:43,001 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 10:30:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1325066419, now seen corresponding path program 1 times [2019-11-20 10:30:43,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:30:43,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [623574712] [2019-11-20 10:30:43,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbec4e43-62b9-4bbb-9427-f6979321949c/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:30:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:43,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-20 10:30:43,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:30:43,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:30:43,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:30:43,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:43,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:30:43,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 10:30:43,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:43,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-20 10:30:43,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:30:43,665 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-20 10:30:43,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:30:43,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-20 10:30:43,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 10:30:43,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:30:43,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:43,748 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-20 10:30:43,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2019-11-20 10:30:43,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2019-11-20 10:30:43,946 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-20 10:30:43,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:43,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:30:43,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-20 10:30:44,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-11-20 10:30:44,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:30:44,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:44,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:30:44,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:46 [2019-11-20 10:30:44,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2019-11-20 10:30:44,250 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-20 10:30:44,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:30:44,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:30:44,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-20 10:31:02,748 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 10:31:02,759 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 10:31:02,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:31:02,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 69 [2019-11-20 10:31:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:31:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:31:02,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:31:02,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 10:31:02,874 INFO L567 ElimStorePlain]: treesize reduction 74, result has 41.7 percent of original size [2019-11-20 10:31:02,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:31:02,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:52 [2019-11-20 10:31:09,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 10:31:09,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:31:09,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:31:09,506 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-20 10:31:09,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2019-11-20 10:31:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 10:31:13,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:31:14,250 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-20 10:31:14,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:31:14,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:31:14,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-20 10:31:18,750 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-20 10:31:19,111 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 10:31:19,851 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-20 10:31:19,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:31:20,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:31:20,100 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((sll_update_at_~head.offset (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (exists ((v_sll_update_at_~head.offset_64 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse0 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (or (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| sll_update_at_~head.base (store (select |#memory_$Pointer$.base| sll_update_at_~head.base) sll_update_at_~head.offset v_DerPreprocessor_16)) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1)) (not (= (bvadd (select |#valid| (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_sll_update_at_~head.offset_64 v_DerPreprocessor_15))) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1))))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-20 10:31:20,103 INFO L168 Benchmark]: Toolchain (without parser) took 190070.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -99.4 MB). Peak memory consumption was 225.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:31:20,104 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:31:20,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 694.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:31:20,104 INFO L168 Benchmark]: Boogie Preprocessor took 93.06 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-20 10:31:20,104 INFO L168 Benchmark]: RCFGBuilder took 710.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:31:20,105 INFO L168 Benchmark]: TraceAbstraction took 188569.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:31:20,106 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 694.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.06 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 710.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 188569.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((sll_update_at_~head.offset (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (exists ((v_sll_update_at_~head.offset_64 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse0 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (or (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| sll_update_at_~head.base (store (select |#memory_$Pointer$.base| sll_update_at_~head.base) sll_update_at_~head.offset v_DerPreprocessor_16)) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1)) (not (= (bvadd (select |#valid| (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_sll_update_at_~head.offset_64 v_DerPreprocessor_15))) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1))))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((sll_update_at_~head.offset (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (exists ((v_sll_update_at_~head.offset_64 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse0 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (or (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| sll_update_at_~head.base (store (select |#memory_$Pointer$.base| sll_update_at_~head.base) sll_update_at_~head.offset v_DerPreprocessor_16)) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1)) (not (= (bvadd (select |#valid| (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_sll_update_at_~head.offset_64 v_DerPreprocessor_15))) |sll_update_at_#in~head.base|) .cse0)) (_ bv1 1)) (_ bv0 1))))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...