./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/lis_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/lis_unsafe.i -s /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/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 22d1ff4f4fd6702e3a4a8affc05625a9c9bb8113 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:52:50,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:52:50,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:52:50,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:52:50,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:52:50,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:52:50,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:52:50,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:52:50,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:52:50,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:52:50,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:52:50,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:52:50,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:52:50,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:52:50,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:52:50,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:52:50,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:52:50,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:52:50,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:52:50,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:52:50,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:52:50,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:52:50,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:52:50,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:52:50,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:52:50,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:52:50,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:52:50,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:52:50,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:52:50,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:52:50,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:52:50,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:52:50,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:52:50,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:52:50,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:52:50,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:52:50,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:52:50,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:52:50,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:52:50,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:52:50,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:52:50,784 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:52:50,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:52:50,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:52:50,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:52:50,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:52:50,809 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:52:50,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:52:50,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:52:50,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:52:50,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:52:50,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:52:50,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:52:50,810 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:52:50,810 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:52:50,811 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:52:50,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:52:50,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:52:50,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:52:50,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:52:50,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:52:50,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:52:50,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:52:50,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:52:50,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:52:50,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:52:50,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:52:50,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:52:50,813 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_05c14260-77be-4020-a6ac-272a3cea58cb/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 -> 22d1ff4f4fd6702e3a4a8affc05625a9c9bb8113 [2019-11-15 21:52:50,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:52:50,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:52:50,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:52:50,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:52:50,875 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:52:50,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/lis_unsafe.i [2019-11-15 21:52:50,935 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/data/bd59f9f0f/9ab22630f14946868ffa56e4fc554646/FLAG5e85181a7 [2019-11-15 21:52:51,390 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:52:51,392 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/sv-benchmarks/c/array-memsafety/lis_unsafe.i [2019-11-15 21:52:51,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/data/bd59f9f0f/9ab22630f14946868ffa56e4fc554646/FLAG5e85181a7 [2019-11-15 21:52:51,738 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/data/bd59f9f0f/9ab22630f14946868ffa56e4fc554646 [2019-11-15 21:52:51,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:52:51,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:52:51,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:51,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:52:51,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:52:51,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:51" (1/1) ... [2019-11-15 21:52:51,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15242ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:51, skipping insertion in model container [2019-11-15 21:52:51,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:51" (1/1) ... [2019-11-15 21:52:51,755 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:52:51,806 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:52:52,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:52,172 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:52:52,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:52,289 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:52:52,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52 WrapperNode [2019-11-15 21:52:52,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:52,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:52:52,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:52:52,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:52:52,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... [2019-11-15 21:52:52,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... [2019-11-15 21:52:52,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... [2019-11-15 21:52:52,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... [2019-11-15 21:52:52,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... [2019-11-15 21:52:52,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... [2019-11-15 21:52:52,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... [2019-11-15 21:52:52,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:52:52,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:52:52,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:52:52,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:52:52,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:52:52,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:52:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:52:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:52:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:52:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 21:52:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 21:52:52,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 21:52:52,464 INFO L138 BoogieDeclarations]: Found implementation of procedure lis [2019-11-15 21:52:52,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:52:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:52:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:52:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:52:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:52:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:52:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:52:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:52:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:52:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:52:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:52:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:52:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:52:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:52:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:52:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:52:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:52:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:52:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:52:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 21:52:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 21:52:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 21:52:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:52:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:52:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:52:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:52:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:52:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:52:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:52:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:52:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:52:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:52:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:52:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:52:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:52:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:52:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:52:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:52:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:52:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:52:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:52:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:52:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:52:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:52:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:52:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:52:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:52:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:52:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:52:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:52:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:52:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:52:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:52:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:52:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:52:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:52:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:52:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:52:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:52:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:52:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:52:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:52:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:52:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:52:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:52:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:52:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:52:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:52:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:52:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:52:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:52:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:52:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:52:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:52:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:52:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:52:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:52:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:52:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:52:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:52:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:52:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:52:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:52:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:52:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:52:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:52:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:52:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:52:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:52:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:52:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:52:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:52:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:52:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:52:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:52:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:52:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:52:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:52:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:52:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:52:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:52:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:52:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:52:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:52:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:52:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:52:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:52:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:52:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:52:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure lis [2019-11-15 21:52:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:52:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:52:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:52:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:52:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:52:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:52:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:52:53,194 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:52:53,194 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:52:53,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:53 BoogieIcfgContainer [2019-11-15 21:52:53,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:52:53,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:52:53,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:52:53,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:52:53,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:52:51" (1/3) ... [2019-11-15 21:52:53,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a52e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:52:53, skipping insertion in model container [2019-11-15 21:52:53,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:52" (2/3) ... [2019-11-15 21:52:53,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a52e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:52:53, skipping insertion in model container [2019-11-15 21:52:53,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:53" (3/3) ... [2019-11-15 21:52:53,203 INFO L109 eAbstractionObserver]: Analyzing ICFG lis_unsafe.i [2019-11-15 21:52:53,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:52:53,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-15 21:52:53,229 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-15 21:52:53,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:52:53,264 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:52:53,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:52:53,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:52:53,264 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:52:53,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:52:53,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:52:53,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:52:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-15 21:52:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:52:53,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:53,314 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:53,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1727722235, now seen corresponding path program 1 times [2019-11-15 21:52:53,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:53,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000639695] [2019-11-15 21:52:53,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:53,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-11-15 21:52:53,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000639695] [2019-11-15 21:52:53,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:53,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:53,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957018283] [2019-11-15 21:52:53,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:53,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:53,555 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-15 21:52:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:53,790 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-11-15 21:52:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:53,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 21:52:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:53,806 INFO L225 Difference]: With dead ends: 71 [2019-11-15 21:52:53,807 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 21:52:53,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 21:52:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 21:52:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 21:52:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-11-15 21:52:53,856 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 11 [2019-11-15 21:52:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:53,857 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-11-15 21:52:53,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-11-15 21:52:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:52:53,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:53,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:53,859 INFO L410 AbstractCegarLoop]: === Iteration 2 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1727722236, now seen corresponding path program 1 times [2019-11-15 21:52:53,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:53,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362277709] [2019-11-15 21:52:53,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:53,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362277709] [2019-11-15 21:52:53,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:53,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:53,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855314785] [2019-11-15 21:52:53,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:52:53,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:52:53,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:53,971 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 5 states. [2019-11-15 21:52:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:54,242 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-15 21:52:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:52:54,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 21:52:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:54,245 INFO L225 Difference]: With dead ends: 75 [2019-11-15 21:52:54,245 INFO L226 Difference]: Without dead ends: 75 [2019-11-15 21:52:54,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-15 21:52:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2019-11-15 21:52:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 21:52:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2019-11-15 21:52:54,264 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 11 [2019-11-15 21:52:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:54,265 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2019-11-15 21:52:54,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:52:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2019-11-15 21:52:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:52:54,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:54,268 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:54,269 INFO L410 AbstractCegarLoop]: === Iteration 3 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:54,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2019781734, now seen corresponding path program 1 times [2019-11-15 21:52:54,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:54,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322561104] [2019-11-15 21:52:54,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:54,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322561104] [2019-11-15 21:52:54,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:54,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:54,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804468651] [2019-11-15 21:52:54,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:54,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:54,377 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 4 states. [2019-11-15 21:52:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:54,531 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-11-15 21:52:54,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:54,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 21:52:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:54,533 INFO L225 Difference]: With dead ends: 68 [2019-11-15 21:52:54,533 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 21:52:54,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 21:52:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 21:52:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 21:52:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-11-15 21:52:54,540 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 12 [2019-11-15 21:52:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:54,540 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-11-15 21:52:54,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-11-15 21:52:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:52:54,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:54,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:54,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2019781735, now seen corresponding path program 1 times [2019-11-15 21:52:54,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:54,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534985543] [2019-11-15 21:52:54,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:54,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534985543] [2019-11-15 21:52:54,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:54,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:52:54,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420012782] [2019-11-15 21:52:54,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:54,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:54,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:54,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:54,696 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 6 states. [2019-11-15 21:52:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:55,080 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2019-11-15 21:52:55,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:55,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-15 21:52:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:55,082 INFO L225 Difference]: With dead ends: 82 [2019-11-15 21:52:55,082 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 21:52:55,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 21:52:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2019-11-15 21:52:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 21:52:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2019-11-15 21:52:55,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 12 [2019-11-15 21:52:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:55,095 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-11-15 21:52:55,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2019-11-15 21:52:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 21:52:55,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:55,096 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:55,097 INFO L410 AbstractCegarLoop]: === Iteration 5 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -316474582, now seen corresponding path program 1 times [2019-11-15 21:52:55,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:55,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690942500] [2019-11-15 21:52:55,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:55,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690942500] [2019-11-15 21:52:55,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:55,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:55,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451832304] [2019-11-15 21:52:55,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:55,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:55,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:55,198 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 6 states. [2019-11-15 21:52:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:55,403 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-11-15 21:52:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:52:55,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 21:52:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:55,404 INFO L225 Difference]: With dead ends: 66 [2019-11-15 21:52:55,404 INFO L226 Difference]: Without dead ends: 66 [2019-11-15 21:52:55,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:52:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-15 21:52:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-15 21:52:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 21:52:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-11-15 21:52:55,410 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 14 [2019-11-15 21:52:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:55,410 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-11-15 21:52:55,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-11-15 21:52:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:52:55,411 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:55,411 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:55,412 INFO L410 AbstractCegarLoop]: === Iteration 6 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:55,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1174174655, now seen corresponding path program 1 times [2019-11-15 21:52:55,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:55,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255556849] [2019-11-15 21:52:55,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:55,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255556849] [2019-11-15 21:52:55,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343361545] [2019-11-15 21:52:55,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:52:55,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:55,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:52:55,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2019-11-15 21:52:55,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307684470] [2019-11-15 21:52:55,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:55,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:52:55,744 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 6 states. [2019-11-15 21:52:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:55,900 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-15 21:52:55,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:55,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 21:52:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:55,903 INFO L225 Difference]: With dead ends: 108 [2019-11-15 21:52:55,904 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 21:52:55,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:52:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 21:52:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2019-11-15 21:52:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 21:52:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-11-15 21:52:55,923 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 15 [2019-11-15 21:52:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:55,924 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-11-15 21:52:55,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-11-15 21:52:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:52:55,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:55,926 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:56,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:56,130 INFO L410 AbstractCegarLoop]: === Iteration 7 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash -494116285, now seen corresponding path program 1 times [2019-11-15 21:52:56,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:56,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556579740] [2019-11-15 21:52:56,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:56,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:56,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:56,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556579740] [2019-11-15 21:52:56,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509227690] [2019-11-15 21:52:56,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:56,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 21:52:56,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:56,434 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_42|]} [2019-11-15 21:52:56,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:56,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 [2019-11-15 21:52:56,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:56,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:56,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 21:52:56,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:56,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:56,493 INFO L496 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-11-15 21:52:56,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2019-11-15 21:52:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:56,644 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:56,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-11-15 21:52:56,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427979351] [2019-11-15 21:52:56,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:52:56,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:52:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:52:56,645 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 10 states. [2019-11-15 21:52:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:57,076 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2019-11-15 21:52:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:57,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-15 21:52:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:57,078 INFO L225 Difference]: With dead ends: 113 [2019-11-15 21:52:57,078 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 21:52:57,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:52:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 21:52:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2019-11-15 21:52:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 21:52:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2019-11-15 21:52:57,089 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 15 [2019-11-15 21:52:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:57,089 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2019-11-15 21:52:57,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:52:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2019-11-15 21:52:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 21:52:57,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:57,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:57,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:57,293 INFO L410 AbstractCegarLoop]: === Iteration 8 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1366855037, now seen corresponding path program 1 times [2019-11-15 21:52:57,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:57,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717744738] [2019-11-15 21:52:57,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:57,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:57,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:57,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717744738] [2019-11-15 21:52:57,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851815395] [2019-11-15 21:52:57,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:57,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:52:57,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:57,520 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:57,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-15 21:52:57,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785805253] [2019-11-15 21:52:57,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:52:57,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:52:57,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:52:57,521 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 9 states. [2019-11-15 21:52:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:57,767 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2019-11-15 21:52:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:52:57,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-15 21:52:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:57,769 INFO L225 Difference]: With dead ends: 180 [2019-11-15 21:52:57,769 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 21:52:57,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:52:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 21:52:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 104. [2019-11-15 21:52:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:52:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2019-11-15 21:52:57,781 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 18 [2019-11-15 21:52:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:57,781 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2019-11-15 21:52:57,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:52:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2019-11-15 21:52:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:52:57,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:57,783 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:57,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:57,990 INFO L410 AbstractCegarLoop]: === Iteration 9 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1163958182, now seen corresponding path program 1 times [2019-11-15 21:52:57,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:57,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178678698] [2019-11-15 21:52:57,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:57,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:57,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:58,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178678698] [2019-11-15 21:52:58,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178304739] [2019-11-15 21:52:58,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:58,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:52:58,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:58,279 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:58,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2019-11-15 21:52:58,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052382158] [2019-11-15 21:52:58,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:52:58,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:52:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:52:58,280 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 12 states. [2019-11-15 21:52:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:58,737 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-11-15 21:52:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:52:58,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-15 21:52:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:58,738 INFO L225 Difference]: With dead ends: 132 [2019-11-15 21:52:58,738 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 21:52:58,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:52:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 21:52:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2019-11-15 21:52:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 21:52:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2019-11-15 21:52:58,746 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 19 [2019-11-15 21:52:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:58,746 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2019-11-15 21:52:58,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:52:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2019-11-15 21:52:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:52:58,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:58,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:58,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:58,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1722963976, now seen corresponding path program 1 times [2019-11-15 21:52:58,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:58,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329012742] [2019-11-15 21:52:58,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:52:59,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329012742] [2019-11-15 21:52:59,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:59,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:52:59,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35632032] [2019-11-15 21:52:59,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:52:59,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:59,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:52:59,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:59,004 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand 7 states. [2019-11-15 21:52:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:59,194 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2019-11-15 21:52:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:52:59,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-15 21:52:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:59,196 INFO L225 Difference]: With dead ends: 104 [2019-11-15 21:52:59,196 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 21:52:59,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:52:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 21:52:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2019-11-15 21:52:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 21:52:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2019-11-15 21:52:59,218 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 20 [2019-11-15 21:52:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:59,218 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2019-11-15 21:52:59,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:52:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2019-11-15 21:52:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:52:59,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:59,220 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:59,220 INFO L410 AbstractCegarLoop]: === Iteration 11 === [lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr9REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr27ASSERT_VIOLATIONMEMORY_FREE, lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr11REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr14REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr26ASSERT_VIOLATIONMEMORY_FREE, lisErr19REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr6REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 21:52:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1604629858, now seen corresponding path program 2 times [2019-11-15 21:52:59,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:59,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758914092] [2019-11-15 21:52:59,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:59,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:59,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:59,317 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:52:59,318 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:52:59,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:52:59 BoogieIcfgContainer [2019-11-15 21:52:59,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:52:59,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:52:59,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:52:59,378 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:52:59,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:53" (3/4) ... [2019-11-15 21:52:59,382 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:52:59,444 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_05c14260-77be-4020-a6ac-272a3cea58cb/bin/uautomizer/witness.graphml [2019-11-15 21:52:59,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:52:59,446 INFO L168 Benchmark]: Toolchain (without parser) took 7705.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 940.7 MB in the beginning and 848.3 MB in the end (delta: 92.3 MB). Peak memory consumption was 294.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:59,446 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:52:59,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:59,448 INFO L168 Benchmark]: Boogie Preprocessor took 92.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:59,453 INFO L168 Benchmark]: RCFGBuilder took 811.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:59,453 INFO L168 Benchmark]: TraceAbstraction took 6180.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 859.5 MB in the end (delta: 172.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:59,455 INFO L168 Benchmark]: Witness Printer took 67.02 ms. Allocated memory is still 1.2 GB. Free memory was 859.5 MB in the beginning and 848.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:59,456 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 549.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 811.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6180.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 859.5 MB in the end (delta: 172.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. * Witness Printer took 67.02 ms. Allocated memory is still 1.2 GB. Free memory was 859.5 MB in the beginning and 848.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 521]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L531] int *a; [L532] int N = __VERIFIER_nondet_int(); [L533] COND FALSE !(N < 1) VAL [N=2] [L535] CALL lis(a, N) VAL [\old(N)=2, a={9:11}] [L514] int *best, *prev, i, j, max = 0; [L515] best = (int*) malloc(sizeof(int) * N) [L516] prev = (int*) malloc(sizeof(int) * N) [L517] i = 0 VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=0, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L517] COND TRUE i < N VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=0, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L518] best[i] = 1 VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=0, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L518] prev[i] = i VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=0, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L517] i++ VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=1, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L517] COND TRUE i < N VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=1, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L518] best[i] = 1 VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=1, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L518] prev[i] = i VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=1, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L517] i++ VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=2, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L517] COND FALSE !(i < N) VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=2, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L519] i = 1 VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=1, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L519] COND TRUE i < N [L520] j = 0 VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=1, j=0, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L520] COND TRUE j < i VAL [\old(N)=2, a={9:11}, a={9:11}, best={-1:0}, i=1, j=0, malloc(sizeof(int) * N)={1:0}, malloc(sizeof(int) * N)={-1:0}, max=0, N=2, prev={1:0}] [L521] a[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 94 locations, 29 error locations. Result: UNSAFE, OverallTime: 6.1s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 514 SDtfs, 1167 SDslu, 942 SDs, 0 SdLazy, 1628 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 183 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 200 ConstructedInterpolants, 6 QuantifiedInterpolants, 15514 SizeOfPredicates, 13 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 6/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...