./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/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 c3fd3c6466616b2760d7784dc961566e83c949cf ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/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 c3fd3c6466616b2760d7784dc961566e83c949cf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:45:13,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:45:13,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:45:13,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:45:13,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:45:13,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:45:13,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:45:13,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:45:13,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:45:13,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:45:13,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:45:13,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:45:13,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:45:13,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:45:13,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:45:13,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:45:13,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:45:13,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:45:13,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:45:13,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:45:13,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:45:13,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:45:13,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:45:13,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:45:13,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:45:13,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:45:13,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:45:13,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:45:13,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:45:13,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:45:13,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:45:13,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:45:13,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:45:13,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:45:13,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:45:13,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:45:13,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:45:13,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:45:13,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:45:13,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:45:13,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:45:13,983 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 17:45:13,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:45:13,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:45:13,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:45:13,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:45:13,996 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:45:13,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:45:13,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:45:13,997 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:45:13,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:45:13,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:45:13,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:45:13,998 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:45:13,998 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:45:13,998 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:45:13,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:45:13,998 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:45:13,998 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:45:13,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:45:13,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:45:13,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:45:13,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:45:13,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:45:13,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:45:14,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:45:14,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:45:14,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:45:14,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:45:14,000 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:45:14,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/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 -> c3fd3c6466616b2760d7784dc961566e83c949cf [2019-12-07 17:45:14,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:45:14,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:45:14,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:45:14,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:45:14,116 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:45:14,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-12-07 17:45:14,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/d1ecda102/c846240d98df406a84fd5030d6d88c8c/FLAG0979429ad [2019-12-07 17:45:14,636 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:45:14,636 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-12-07 17:45:14,645 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/d1ecda102/c846240d98df406a84fd5030d6d88c8c/FLAG0979429ad [2019-12-07 17:45:14,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/d1ecda102/c846240d98df406a84fd5030d6d88c8c [2019-12-07 17:45:14,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:45:14,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:45:14,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:45:14,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:45:14,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:45:14,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:45:14" (1/1) ... [2019-12-07 17:45:14,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dfeea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:14, skipping insertion in model container [2019-12-07 17:45:14,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:45:14" (1/1) ... [2019-12-07 17:45:14,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:45:14,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:45:14,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:45:14,899 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 17:45:14,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f117fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:14, skipping insertion in model container [2019-12-07 17:45:14,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:45:14,900 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 17:45:14,902 INFO L168 Benchmark]: Toolchain (without parser) took 243.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:14,902 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:45:14,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:14,904 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 544]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 17:45:16,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:45:16,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:45:16,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:45:16,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:45:16,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:45:16,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:45:16,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:45:16,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:45:16,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:45:16,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:45:16,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:45:16,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:45:16,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:45:16,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:45:16,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:45:16,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:45:16,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:45:16,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:45:16,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:45:16,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:45:16,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:45:16,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:45:16,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:45:16,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:45:16,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:45:16,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:45:16,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:45:16,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:45:16,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:45:16,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:45:16,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:45:16,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:45:16,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:45:16,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:45:16,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:45:16,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:45:16,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:45:16,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:45:16,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:45:16,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:45:16,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 17:45:16,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:45:16,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:45:16,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:45:16,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:45:16,069 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:45:16,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:45:16,070 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:45:16,070 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:45:16,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:45:16,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:45:16,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:45:16,070 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:45:16,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:45:16,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:45:16,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:45:16,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:45:16,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:45:16,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:45:16,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:45:16,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:45:16,072 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:45:16,073 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:45:16,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:45:16,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:45:16,073 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_0571f034-f2b7-4ca7-96ae-7869c38b495b/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 -> c3fd3c6466616b2760d7784dc961566e83c949cf [2019-12-07 17:45:16,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:45:16,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:45:16,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:45:16,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:45:16,255 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:45:16,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-12-07 17:45:16,296 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/1b07abaf5/e7b03d7ce3254f278bed46b0f4867b1a/FLAGdf82625e2 [2019-12-07 17:45:16,691 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:45:16,691 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2019-12-07 17:45:16,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/1b07abaf5/e7b03d7ce3254f278bed46b0f4867b1a/FLAGdf82625e2 [2019-12-07 17:45:16,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/data/1b07abaf5/e7b03d7ce3254f278bed46b0f4867b1a [2019-12-07 17:45:16,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:45:16,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:45:16,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:45:16,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:45:16,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:45:16,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:45:16" (1/1) ... [2019-12-07 17:45:16,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cb4662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:16, skipping insertion in model container [2019-12-07 17:45:16,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:45:16" (1/1) ... [2019-12-07 17:45:16,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:45:16,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:45:16,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:45:16,997 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 17:45:17,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:45:17,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:45:17,029 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:45:17,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:45:17,090 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:45:17,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17 WrapperNode [2019-12-07 17:45:17,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:45:17,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:45:17,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:45:17,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:45:17,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... [2019-12-07 17:45:17,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... [2019-12-07 17:45:17,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... [2019-12-07 17:45:17,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... [2019-12-07 17:45:17,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... [2019-12-07 17:45:17,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... [2019-12-07 17:45:17,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... [2019-12-07 17:45:17,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:45:17,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:45:17,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:45:17,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:45:17,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:45:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:45:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:45:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 17:45:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 17:45:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 17:45:17,182 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-12-07 17:45:17,182 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-12-07 17:45:17,182 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-12-07 17:45:17,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:45:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 17:45:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:45:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:45:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:45:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:45:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 17:45:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:45:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:45:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:45:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:45:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:45:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:45:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:45:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-12-07 17:45:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 17:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:45:17,680 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:45:17,680 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 17:45:17,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:45:17 BoogieIcfgContainer [2019-12-07 17:45:17,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:45:17,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:45:17,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:45:17,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:45:17,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:45:16" (1/3) ... [2019-12-07 17:45:17,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1351350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:45:17, skipping insertion in model container [2019-12-07 17:45:17,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:45:17" (2/3) ... [2019-12-07 17:45:17,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1351350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:45:17, skipping insertion in model container [2019-12-07 17:45:17,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:45:17" (3/3) ... [2019-12-07 17:45:17,688 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2019-12-07 17:45:17,697 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:45:17,704 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-12-07 17:45:17,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-12-07 17:45:17,726 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:45:17,726 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:45:17,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:45:17,726 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:45:17,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:45:17,726 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:45:17,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:45:17,726 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:45:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-12-07 17:45:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 17:45:17,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:17,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:17,745 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash -13807983, now seen corresponding path program 1 times [2019-12-07 17:45:17,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:17,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893264057] [2019-12-07 17:45:17,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:17,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 17:45:17,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:17,868 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:17,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893264057] [2019-12-07 17:45:17,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:17,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 17:45:17,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068686299] [2019-12-07 17:45:17,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:45:17,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:45:17,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:45:17,902 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-12-07 17:45:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:17,920 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-12-07 17:45:17,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:45:17,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 17:45:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:17,929 INFO L225 Difference]: With dead ends: 110 [2019-12-07 17:45:17,930 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 17:45:17,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:45:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 17:45:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-12-07 17:45:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:45:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-12-07 17:45:17,964 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-12-07 17:45:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:17,964 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-12-07 17:45:17,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:45:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-12-07 17:45:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:45:17,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:17,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:18,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:45:18,167 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash -427980567, now seen corresponding path program 1 times [2019-12-07 17:45:18,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:18,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648362531] [2019-12-07 17:45:18,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:18,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:45:18,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:18,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:18,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,311 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:45:18,349 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:18,350 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-12-07 17:45:18,352 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:18,371 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 17:45:18,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:18,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 17:45:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:18,386 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:18,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648362531] [2019-12-07 17:45:18,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:18,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 17:45:18,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491333811] [2019-12-07 17:45:18,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:45:18,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:18,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:45:18,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:18,443 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2019-12-07 17:45:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:18,990 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-12-07 17:45:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:45:18,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 17:45:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:18,996 INFO L225 Difference]: With dead ends: 116 [2019-12-07 17:45:18,996 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 17:45:18,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 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-12-07 17:45:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 17:45:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-12-07 17:45:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:45:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-12-07 17:45:19,013 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-12-07 17:45:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:19,014 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-12-07 17:45:19,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:45:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-12-07 17:45:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:45:19,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:19,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:19,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:45:19,216 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -427980566, now seen corresponding path program 1 times [2019-12-07 17:45:19,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:19,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418518648] [2019-12-07 17:45:19,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:19,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:45:19,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:19,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:19,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:19,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:19,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:19,334 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:19,341 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:19,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:19,341 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 17:45:19,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:19,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:45:19,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:19,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:19,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:19,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:19,393 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:19,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:19,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:19,402 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-12-07 17:45:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:19,415 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:19,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418518648] [2019-12-07 17:45:19,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:19,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 17:45:19,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221870943] [2019-12-07 17:45:19,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:45:19,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:19,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:45:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:19,626 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-12-07 17:45:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:21,380 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-12-07 17:45:21,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:45:21,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 17:45:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:21,382 INFO L225 Difference]: With dead ends: 115 [2019-12-07 17:45:21,382 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 17:45:21,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:45:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 17:45:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-12-07 17:45:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:45:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-12-07 17:45:21,389 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-12-07 17:45:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:21,389 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-12-07 17:45:21,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:45:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-12-07 17:45:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:45:21,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:21,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:21,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:45:21,591 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash -382495554, now seen corresponding path program 1 times [2019-12-07 17:45:21,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:21,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361463987] [2019-12-07 17:45:21,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:21,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:45:21,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:21,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:21,701 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:21,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:21,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:21,703 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:45:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:21,706 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:21,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361463987] [2019-12-07 17:45:21,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:21,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 17:45:21,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971446020] [2019-12-07 17:45:21,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:21,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:21,711 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 3 states. [2019-12-07 17:45:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:21,817 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-12-07 17:45:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:21,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 17:45:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:21,818 INFO L225 Difference]: With dead ends: 108 [2019-12-07 17:45:21,818 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 17:45:21,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-12-07 17:45:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 17:45:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-12-07 17:45:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 17:45:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-12-07 17:45:21,824 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-12-07 17:45:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:21,824 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-12-07 17:45:21,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-12-07 17:45:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:45:21,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:21,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:22,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:45:22,026 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash -382495553, now seen corresponding path program 1 times [2019-12-07 17:45:22,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:22,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244050330] [2019-12-07 17:45:22,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:22,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:45:22,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:22,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:22,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:22,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:22,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:22,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:45:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:22,139 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:22,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244050330] [2019-12-07 17:45:22,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:22,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 17:45:22,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649204760] [2019-12-07 17:45:22,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:45:22,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:22,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:45:22,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:22,184 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-12-07 17:45:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:22,427 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-12-07 17:45:22,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:22,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 17:45:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:22,429 INFO L225 Difference]: With dead ends: 107 [2019-12-07 17:45:22,429 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 17:45:22,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-12-07 17:45:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 17:45:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-12-07 17:45:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:45:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-12-07 17:45:22,437 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-12-07 17:45:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:22,437 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-12-07 17:45:22,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:45:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-12-07 17:45:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:45:22,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:22,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:22,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:45:22,640 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846002, now seen corresponding path program 1 times [2019-12-07 17:45:22,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:22,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918308765] [2019-12-07 17:45:22,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:22,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:45:22,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:22,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:22,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:22,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:22,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:22,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:45:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:22,738 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:22,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918308765] [2019-12-07 17:45:22,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:22,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 17:45:22,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006324066] [2019-12-07 17:45:22,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:22,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:22,742 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-12-07 17:45:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:22,851 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-12-07 17:45:22,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:22,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 17:45:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:22,852 INFO L225 Difference]: With dead ends: 105 [2019-12-07 17:45:22,852 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 17:45:22,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-12-07 17:45:22,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 17:45:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-12-07 17:45:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:45:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-12-07 17:45:22,857 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-12-07 17:45:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:22,857 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-12-07 17:45:22,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-12-07 17:45:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:45:22,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:22,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:23,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:45:23,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846001, now seen corresponding path program 1 times [2019-12-07 17:45:23,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:23,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706346402] [2019-12-07 17:45:23,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:23,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:45:23,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:23,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:23,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:23,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:23,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:23,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:45:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:23,215 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:23,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706346402] [2019-12-07 17:45:23,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:23,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 17:45:23,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651159573] [2019-12-07 17:45:23,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:45:23,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:45:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:23,250 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-12-07 17:45:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:23,477 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-12-07 17:45:23,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:45:23,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:45:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:23,478 INFO L225 Difference]: With dead ends: 106 [2019-12-07 17:45:23,478 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 17:45:23,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-12-07 17:45:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 17:45:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-12-07 17:45:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 17:45:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-12-07 17:45:23,483 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-12-07 17:45:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:23,483 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-12-07 17:45:23,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:45:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-12-07 17:45:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:45:23,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:23,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:23,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:45:23,685 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:23,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461638, now seen corresponding path program 1 times [2019-12-07 17:45:23,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:23,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563442388] [2019-12-07 17:45:23,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:23,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:45:23,755 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:23,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:23,758 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:23,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:23,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:23,760 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:45:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:23,768 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:23,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563442388] [2019-12-07 17:45:23,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:23,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:45:23,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940932722] [2019-12-07 17:45:23,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:45:23,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:23,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:45:23,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:45:23,794 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2019-12-07 17:45:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:24,091 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-12-07 17:45:24,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:45:24,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 17:45:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:24,092 INFO L225 Difference]: With dead ends: 135 [2019-12-07 17:45:24,092 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 17:45:24,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:45:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 17:45:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-12-07 17:45:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 17:45:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-12-07 17:45:24,098 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-12-07 17:45:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:24,098 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-12-07 17:45:24,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:45:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-12-07 17:45:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:45:24,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:24,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:24,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:45:24,301 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461639, now seen corresponding path program 1 times [2019-12-07 17:45:24,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:24,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160529158] [2019-12-07 17:45:24,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:24,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:45:24,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:24,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:24,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:24,452 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:24,452 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:24,452 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:45:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:24,467 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:24,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:24,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160529158] [2019-12-07 17:45:24,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:24,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 17:45:24,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623842734] [2019-12-07 17:45:24,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:45:24,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:45:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:45:24,530 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-12-07 17:45:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:25,062 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-12-07 17:45:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:45:25,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 17:45:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:25,064 INFO L225 Difference]: With dead ends: 109 [2019-12-07 17:45:25,064 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 17:45:25,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:45:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 17:45:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-12-07 17:45:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:45:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-12-07 17:45:25,067 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-12-07 17:45:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:25,067 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-12-07 17:45:25,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:45:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-12-07 17:45:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:45:25,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:25,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:25,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:45:25,269 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 278501480, now seen corresponding path program 1 times [2019-12-07 17:45:25,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:25,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100301574] [2019-12-07 17:45:25,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:25,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:45:25,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:25,422 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:25,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:25,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:25,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 17:45:25,504 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:25,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:25,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:25,521 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-12-07 17:45:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:25,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100301574] [2019-12-07 17:45:25,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:25,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 17:45:25,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965348101] [2019-12-07 17:45:25,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:45:25,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:45:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:45:25,645 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 12 states. [2019-12-07 17:45:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:26,586 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-12-07 17:45:26,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:45:26,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-07 17:45:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:26,588 INFO L225 Difference]: With dead ends: 106 [2019-12-07 17:45:26,588 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 17:45:26,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:45:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 17:45:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-12-07 17:45:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 17:45:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-12-07 17:45:26,591 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 18 [2019-12-07 17:45:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:26,592 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-12-07 17:45:26,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:45:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-12-07 17:45:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:45:26,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:26,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:26,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:45:26,794 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:26,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash 278501479, now seen corresponding path program 1 times [2019-12-07 17:45:26,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:26,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597975919] [2019-12-07 17:45:26,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:26,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:45:26,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:26,870 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:26,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597975919] [2019-12-07 17:45:26,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:26,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:45:26,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714007477] [2019-12-07 17:45:26,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:45:26,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:26,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:45:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:45:26,890 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 5 states. [2019-12-07 17:45:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:27,193 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-12-07 17:45:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:45:27,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 17:45:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:27,194 INFO L225 Difference]: With dead ends: 137 [2019-12-07 17:45:27,194 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 17:45:27,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:45:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 17:45:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2019-12-07 17:45:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 17:45:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-12-07 17:45:27,198 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-12-07 17:45:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:27,198 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-12-07 17:45:27,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:45:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-12-07 17:45:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:45:27,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:27,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:27,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 17:45:27,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash 271010156, now seen corresponding path program 1 times [2019-12-07 17:45:27,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:27,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130157510] [2019-12-07 17:45:27,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:27,527 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:45:27,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:27,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:27,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130157510] [2019-12-07 17:45:27,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:27,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:45:27,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606531391] [2019-12-07 17:45:27,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:45:27,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:27,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:45:27,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:27,543 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-12-07 17:45:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:27,580 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-12-07 17:45:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:45:27,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:45:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:27,582 INFO L225 Difference]: With dead ends: 112 [2019-12-07 17:45:27,582 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 17:45:27,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-12-07 17:45:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 17:45:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-12-07 17:45:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:45:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-12-07 17:45:27,584 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-12-07 17:45:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:27,585 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-12-07 17:45:27,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:45:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-12-07 17:45:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:45:27,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:27,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:27,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 17:45:27,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash -188618374, now seen corresponding path program 1 times [2019-12-07 17:45:27,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:27,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105778595] [2019-12-07 17:45:27,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:27,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:45:27,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:27,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:27,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:27,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:45:27,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:27,877 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:27,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:27,891 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:27,904 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,904 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-12-07 17:45:27,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 17:45:27,945 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:27,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:45:27,959 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:27,966 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:27,966 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-12-07 17:45:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:27,983 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:28,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105778595] [2019-12-07 17:45:28,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:28,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 17:45:28,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804234907] [2019-12-07 17:45:28,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:45:28,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:28,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:45:28,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:45:28,280 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 10 states. [2019-12-07 17:45:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:29,592 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-12-07 17:45:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:45:29,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-07 17:45:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:29,594 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:45:29,594 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 17:45:29,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:45:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 17:45:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-12-07 17:45:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:45:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-12-07 17:45:29,598 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-12-07 17:45:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:29,598 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-12-07 17:45:29,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:45:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-12-07 17:45:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:45:29,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:29,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:29,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 17:45:29,800 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash -188618375, now seen corresponding path program 1 times [2019-12-07 17:45:29,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:29,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690729159] [2019-12-07 17:45:29,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:29,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:45:29,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:29,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:29,880 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:29,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:29,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:29,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:45:29,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:29,887 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:29,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:29,893 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:29,893 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-12-07 17:45:29,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 23 treesize of output 11 [2019-12-07 17:45:29,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:29,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:29,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:29,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-12-07 17:45:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:29,908 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:29,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690729159] [2019-12-07 17:45:29,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:29,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:45:29,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474111737] [2019-12-07 17:45:29,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:45:29,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:29,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:45:29,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:45:29,919 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 5 states. [2019-12-07 17:45:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:30,226 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-12-07 17:45:30,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:45:30,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 17:45:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:30,227 INFO L225 Difference]: With dead ends: 113 [2019-12-07 17:45:30,227 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 17:45:30,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 17:45:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-12-07 17:45:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:45:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-12-07 17:45:30,230 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-12-07 17:45:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:30,231 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-12-07 17:45:30,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:45:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-12-07 17:45:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:45:30,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:30,231 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] [2019-12-07 17:45:30,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 17:45:30,432 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:45:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:30,433 INFO L82 PathProgramCache]: Analyzing trace with hash 818029954, now seen corresponding path program 1 times [2019-12-07 17:45:30,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:45:30,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072828021] [2019-12-07 17:45:30,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 17:45:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:30,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:45:30,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:30,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:30,597 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:30,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:30,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:30,605 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:30,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:30,610 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:30,610 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 17:45:30,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:30,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:45:30,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:30,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:30,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:30,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:45:30,658 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:30,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:30,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:30,665 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-12-07 17:45:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:30,683 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:45:30,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:30,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:30,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:30,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:33,643 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 17:45:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:36,310 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 17:45:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:45:36,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072828021] [2019-12-07 17:45:36,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:36,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 17:45:36,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090012799] [2019-12-07 17:45:36,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:45:36,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:45:36,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:45:36,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-12-07 17:45:36,435 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-12-07 17:45:41,286 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 17:45:59,938 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 17:46:10,900 WARN L192 SmtUtils]: Spent 4.18 s on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 17:46:27,615 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 17:46:36,321 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-07 17:46:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:53,429 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-12-07 17:46:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:46:53,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 17:46:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:53,432 INFO L225 Difference]: With dead ends: 129 [2019-12-07 17:46:53,432 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 17:46:53,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=66, Invalid=164, Unknown=10, NotChecked=0, Total=240 [2019-12-07 17:46:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 17:46:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-12-07 17:46:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 17:46:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-12-07 17:46:53,436 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-12-07 17:46:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:53,436 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-12-07 17:46:53,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:46:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-12-07 17:46:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:46:53,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:53,437 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] [2019-12-07 17:46:53,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 17:46:53,638 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:46:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:53,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358802, now seen corresponding path program 1 times [2019-12-07 17:46:53,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:46:53,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496696539] [2019-12-07 17:46:53,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 17:46:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:53,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:46:53,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:46:53,766 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:46:53,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:53,812 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 12 treesize of output 16 [2019-12-07 17:46:53,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:53,813 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:53,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:53,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:46:53,815 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-12-07 17:46:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:46:53,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496696539] [2019-12-07 17:46:53,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:46:53,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-12-07 17:46:53,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776857939] [2019-12-07 17:46:53,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:46:53,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:46:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:46:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:46:53,819 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 7 states. [2019-12-07 17:46:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:54,329 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2019-12-07 17:46:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:46:54,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 17:46:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:54,330 INFO L225 Difference]: With dead ends: 147 [2019-12-07 17:46:54,330 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 17:46:54,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:46:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 17:46:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 115. [2019-12-07 17:46:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 17:46:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-12-07 17:46:54,333 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 22 [2019-12-07 17:46:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:54,333 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-12-07 17:46:54,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:46:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-12-07 17:46:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:46:54,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:54,334 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] [2019-12-07 17:46:54,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 17:46:54,535 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:46:54,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358803, now seen corresponding path program 1 times [2019-12-07 17:46:54,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:46:54,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524883379] [2019-12-07 17:46:54,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 17:46:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:54,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:46:54,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:46:54,643 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:46:54,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:54,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 17:46:54,740 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:54,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:54,754 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:54,754 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-12-07 17:46:54,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:54,870 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 16 treesize of output 20 [2019-12-07 17:46:54,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:54,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:54,872 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:54,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:54,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:54,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2019-12-07 17:46:54,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:54,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:55,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:55,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:55,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:55,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:46:55,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524883379] [2019-12-07 17:46:55,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:46:55,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 17:46:55,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843562757] [2019-12-07 17:46:55,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:46:55,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:46:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:46:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:46:55,715 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 10 states. [2019-12-07 17:46:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:46:56,231 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-12-07 17:46:56,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:46:56,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 17:46:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:46:56,233 INFO L225 Difference]: With dead ends: 110 [2019-12-07 17:46:56,233 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 17:46:56,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:46:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 17:46:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-12-07 17:46:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:46:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-12-07 17:46:56,237 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 22 [2019-12-07 17:46:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:46:56,237 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-12-07 17:46:56,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:46:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-12-07 17:46:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:46:56,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:46:56,238 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] [2019-12-07 17:46:56,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:46:56,439 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:46:56,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:46:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 147774243, now seen corresponding path program 1 times [2019-12-07 17:46:56,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:46:56,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908575138] [2019-12-07 17:46:56,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 17:46:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:46:56,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:46:56,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:46:56,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:46:56,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:56,617 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:56,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:56,618 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:9 [2019-12-07 17:46:56,685 INFO L430 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_#length_BEFORE_CALL_12|]} [2019-12-07 17:46:56,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:56,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:46:56,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:56,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:56,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:46:56,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 48 [2019-12-07 17:46:56,729 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:46:56,763 INFO L614 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2019-12-07 17:46:56,764 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:46:56,764 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:25 [2019-12-07 17:46:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:46:56,815 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:46:56,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:56,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:56,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:46:56,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:00,073 WARN L192 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 17:47:00,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:00,546 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 17:47:00,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:00,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:47:00,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:47:00,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:47:00,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:00,696 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:00,696 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 13 treesize of output 17 [2019-12-07 17:47:00,696 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:47:00,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:47:00,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:47:00,718 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:14 [2019-12-07 17:47:00,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-12-07 17:47:00,807 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 17:47:00,856 INFO L614 ElimStorePlain]: treesize reduction 11, result has 60.7 percent of original size [2019-12-07 17:47:00,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:47:00,857 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 17:47:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:47:00,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908575138] [2019-12-07 17:47:00,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:47:00,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 17:47:00,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527985567] [2019-12-07 17:47:00,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:47:00,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:47:00,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:47:00,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=196, Unknown=1, NotChecked=0, Total=240 [2019-12-07 17:47:00,995 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 16 states. [2019-12-07 17:47:15,638 WARN L192 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-07 17:47:32,250 WARN L192 SmtUtils]: Spent 16.43 s on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-07 17:47:48,953 WARN L192 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 17:48:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:13,369 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2019-12-07 17:48:13,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:48:13,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 17:48:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:13,370 INFO L225 Difference]: With dead ends: 122 [2019-12-07 17:48:13,370 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 17:48:13,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=102, Invalid=397, Unknown=7, NotChecked=0, Total=506 [2019-12-07 17:48:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 17:48:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2019-12-07 17:48:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:48:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-12-07 17:48:13,374 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-12-07 17:48:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:13,374 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-12-07 17:48:13,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:48:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-12-07 17:48:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:48:13,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:13,374 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:13,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 17:48:13,575 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:48:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2027630961, now seen corresponding path program 1 times [2019-12-07 17:48:13,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:48:13,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459190076] [2019-12-07 17:48:13,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 17:48:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:13,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 17:48:13,661 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:48:13,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:48:13,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:13,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:13,674 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:48:13,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-12-07 17:48:13,826 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_197|], 3=[|v_#length_122|]} [2019-12-07 17:48:13,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:13,835 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 13 treesize of output 17 [2019-12-07 17:48:13,835 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:13,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:13,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:13,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-12-07 17:48:13,874 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:13,910 INFO L614 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2019-12-07 17:48:13,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:48:13,910 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:25 [2019-12-07 17:48:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:13,964 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:48:14,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:14,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:14,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:14,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:48:14,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:48:14,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:14,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:14,402 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 13 treesize of output 17 [2019-12-07 17:48:14,402 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:14,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:14,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 22 [2019-12-07 17:48:14,435 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 17:48:14,497 INFO L614 ElimStorePlain]: treesize reduction 11, result has 64.5 percent of original size [2019-12-07 17:48:14,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:48:14,497 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:67, output treesize:5 [2019-12-07 17:48:14,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:48:25,720 WARN L192 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 17:48:25,723 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-12-07 17:48:39,971 WARN L192 SmtUtils]: Spent 4.21 s on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 17:48:39,973 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-12-07 17:48:39,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:39,997 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 13 treesize of output 17 [2019-12-07 17:48:39,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:48:40,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:48:40,032 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:48:40,033 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:28 [2019-12-07 17:48:40,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:48:40,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 42 [2019-12-07 17:48:40,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:40,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:40,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:40,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:48:40,237 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:48:40,247 INFO L614 ElimStorePlain]: treesize reduction 50, result has 2.0 percent of original size [2019-12-07 17:48:40,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:48:40,248 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:1 [2019-12-07 17:48:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:40,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459190076] [2019-12-07 17:48:40,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:48:40,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-12-07 17:48:40,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524603787] [2019-12-07 17:48:40,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:48:40,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:48:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:48:40,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=279, Unknown=7, NotChecked=0, Total=342 [2019-12-07 17:48:40,255 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 19 states. [2019-12-07 17:48:44,482 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-12-07 17:48:47,119 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-07 17:49:00,913 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 17:49:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:01,288 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2019-12-07 17:49:01,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:49:01,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-12-07 17:49:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:01,291 INFO L225 Difference]: With dead ends: 189 [2019-12-07 17:49:01,291 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 17:49:01,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=141, Invalid=608, Unknown=7, NotChecked=0, Total=756 [2019-12-07 17:49:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 17:49:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 103. [2019-12-07 17:49:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:49:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-12-07 17:49:01,295 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 24 [2019-12-07 17:49:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:01,295 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-12-07 17:49:01,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:49:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-12-07 17:49:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:49:01,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:01,296 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:01,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 17:49:01,496 INFO L410 AbstractCegarLoop]: === Iteration 20 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 17:49:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1181322069, now seen corresponding path program 1 times [2019-12-07 17:49:01,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:49:01,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868233672] [2019-12-07 17:49:01,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0571f034-f2b7-4ca7-96ae-7869c38b495b/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 17:49:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:01,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:49:01,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:49:01,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:49:01,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:01,633 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,633 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:49:01,637 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_138|], 1=[|v_#valid_215|]} [2019-12-07 17:49:01,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:49:01,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:01,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:01,651 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 13 treesize of output 17 [2019-12-07 17:49:01,651 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:01,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,656 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-12-07 17:49:01,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:49:01,669 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:01,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:49:01,686 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:01,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:49:01,697 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:33 [2019-12-07 17:49:18,316 WARN L192 SmtUtils]: Spent 16.55 s on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-12-07 17:49:18,317 INFO L343 Elim1Store]: treesize reduction 521, result has 23.6 percent of original size [2019-12-07 17:49:18,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 244 treesize of output 270 [2019-12-07 17:49:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:49:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:49:18,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:49:18,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:49:18,455 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-07 17:49:18,456 INFO L614 ElimStorePlain]: treesize reduction 301, result has 32.4 percent of original size [2019-12-07 17:49:18,465 INFO L343 Elim1Store]: treesize reduction 331, result has 0.3 percent of original size [2019-12-07 17:49:18,466 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 3 case distinctions, treesize of input 120 treesize of output 13 [2019-12-07 17:49:18,466 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:18,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:18,480 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:49:18,480 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:34 [2019-12-07 17:49:18,527 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 33 treesize of output 15 [2019-12-07 17:49:18,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:18,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:18,544 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 19 treesize of output 7 [2019-12-07 17:49:18,545 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:18,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:49:18,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:49:18,553 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:16 [2019-12-07 17:49:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:18,572 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:49:18,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:49:18,978 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:49:18,991 INFO L534 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:49:19,483 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-07 17:49:19,483 INFO L614 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2019-12-07 17:49:19,514 INFO L534 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:49:19,525 INFO L534 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:49:19,790 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-07 17:49:19,790 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-12-07 17:49:19,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2019-12-07 17:49:19,791 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-12-07 17:49:24,701 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 17:49:29,632 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 17:49:31,789 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 17:49:31,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:49:37,328 WARN L192 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 127 DAG size of output: 102 [2019-12-07 17:49:37,328 INFO L614 ElimStorePlain]: treesize reduction 891, result has 21.3 percent of original size [2019-12-07 17:49:37,371 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:50:12,394 WARN L192 SmtUtils]: Spent 35.02 s on a formula simplification. DAG size of input: 550 DAG size of output: 122 [2019-12-07 17:50:12,394 INFO L614 ElimStorePlain]: treesize reduction 163436, result has 0.3 percent of original size [2019-12-07 17:50:12,418 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:50:18,847 WARN L192 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 296 DAG size of output: 111 [2019-12-07 17:50:18,848 INFO L614 ElimStorePlain]: treesize reduction 5035, result has 5.1 percent of original size [2019-12-07 17:50:18,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:50:18,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:50:18,928 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 80 dim-0 vars, and 13 xjuncts. [2019-12-07 17:50:18,928 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:1507 [2019-12-07 17:50:20,109 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 14 [2019-12-07 17:50:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:50:20,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868233672] [2019-12-07 17:50:20,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:50:20,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-12-07 17:50:20,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711821573] [2019-12-07 17:50:20,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:50:20,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:50:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:50:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=188, Unknown=3, NotChecked=0, Total=240 [2019-12-07 17:50:20,118 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 16 states. [2019-12-07 17:50:23,248 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-12-07 17:50:30,276 WARN L192 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-12-07 17:50:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:50:33,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 17:50:33,191 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 52 more [2019-12-07 17:50:33,196 INFO L168 Benchmark]: Toolchain (without parser) took 316484.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 245.4 MB). Free memory was 948.4 MB in the beginning and 979.1 MB in the end (delta: -30.8 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:33,197 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:50:33,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:33,197 INFO L168 Benchmark]: Boogie Preprocessor took 49.18 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:33,198 INFO L168 Benchmark]: RCFGBuilder took 541.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:33,199 INFO L168 Benchmark]: TraceAbstraction took 315512.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.5 MB). Free memory was 1.0 GB in the beginning and 979.1 MB in the end (delta: 56.6 MB). Peak memory consumption was 165.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:33,201 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.18 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 541.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 315512.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.5 MB). Free memory was 1.0 GB in the beginning and 979.1 MB in the end (delta: 56.6 MB). Peak memory consumption was 165.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...