./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 17ff5ae56efea2deac29e7fa779d53a24810a7c7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 17ff5ae56efea2deac29e7fa779d53a24810a7c7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:15:22,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:15:22,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:15:22,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:15:22,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:15:22,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:15:22,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:15:22,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:15:22,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:15:22,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:15:22,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:15:22,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:15:22,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:15:22,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:15:22,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:15:22,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:15:22,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:15:22,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:15:22,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:15:22,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:15:22,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:15:22,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:15:22,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:15:22,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:15:22,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:15:22,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:15:22,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:15:22,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:15:22,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:15:22,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:15:22,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:15:22,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:15:22,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:15:22,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:15:22,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:15:22,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:15:22,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:15:22,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:15:22,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:15:22,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:15:22,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:15:22,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:15:22,547 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:15:22,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:15:22,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:15:22,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:15:22,549 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:15:22,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:15:22,550 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:15:22,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:15:22,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:15:22,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:15:22,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:15:22,551 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:15:22,552 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:15:22,552 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:15:22,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:15:22,552 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:15:22,553 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:15:22,553 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:15:22,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:15:22,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:15:22,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:15:22,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:15:22,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:15:22,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:15:22,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:15:22,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:15:22,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:15:22,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:15:22,556 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 17ff5ae56efea2deac29e7fa779d53a24810a7c7 [2019-11-28 20:15:22,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:15:22,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:15:22,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:15:22,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:15:22,892 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:15:22,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2019-11-28 20:15:22,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c932c31c6/d986994cbf8043fdaf82733cacb76bd5/FLAGa479280be [2019-11-28 20:15:23,539 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:15:23,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2019-11-28 20:15:23,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c932c31c6/d986994cbf8043fdaf82733cacb76bd5/FLAGa479280be [2019-11-28 20:15:23,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c932c31c6/d986994cbf8043fdaf82733cacb76bd5 [2019-11-28 20:15:23,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:15:23,830 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:15:23,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:15:23,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:15:23,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:15:23,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:23" (1/1) ... [2019-11-28 20:15:23,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e77c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23, skipping insertion in model container [2019-11-28 20:15:23,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:23" (1/1) ... [2019-11-28 20:15:23,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:15:23,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:15:24,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:15:24,300 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:15:24,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:15:24,442 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:15:24,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24 WrapperNode [2019-11-28 20:15:24,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:15:24,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:15:24,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:15:24,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:15:24,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... [2019-11-28 20:15:24,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... [2019-11-28 20:15:24,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... [2019-11-28 20:15:24,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... [2019-11-28 20:15:24,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... [2019-11-28 20:15:24,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... [2019-11-28 20:15:24,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... [2019-11-28 20:15:24,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:15:24,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:15:24,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:15:24,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:15:24,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 20:15:24,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:15:24,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:15:24,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:15:24,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:15:24,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:15:24,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:15:24,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:15:24,573 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 20:15:24,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:15:24,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:15:24,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:15:24,574 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:15:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:15:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:15:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:15:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:15:24,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:15:24,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:15:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:15:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:15:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:15:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:15:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:15:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:15:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:15:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:15:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:15:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:15:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:15:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:15:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:15:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:15:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:15:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:15:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:15:24,584 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:15:24,584 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:15:24,584 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:15:24,584 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:15:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:15:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:15:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:15:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:15:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:15:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:15:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:15:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:15:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:15:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:15:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:15:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:15:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:15:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:15:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:15:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:15:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:15:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:15:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:15:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:15:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:15:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:15:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:15:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:15:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:15:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:15:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:15:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:15:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:15:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:15:24,593 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:15:24,593 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:15:24,593 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:15:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:15:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:15:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:15:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:15:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:15:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:15:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:15:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:15:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:15:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:15:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:15:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:15:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:15:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:15:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:15:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:15:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:15:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:15:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:15:24,601 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:15:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:15:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:15:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 20:15:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:15:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:15:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:15:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:15:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:15:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:15:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:15:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:15:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:15:25,001 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 20:15:25,163 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:15:25,164 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 20:15:25,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:25 BoogieIcfgContainer [2019-11-28 20:15:25,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:15:25,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:15:25,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:15:25,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:15:25,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:15:23" (1/3) ... [2019-11-28 20:15:25,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600950f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:25, skipping insertion in model container [2019-11-28 20:15:25,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:24" (2/3) ... [2019-11-28 20:15:25,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600950f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:25, skipping insertion in model container [2019-11-28 20:15:25,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:25" (3/3) ... [2019-11-28 20:15:25,173 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-2.i [2019-11-28 20:15:25,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:15:25,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 20:15:25,203 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 20:15:25,225 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:15:25,225 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:15:25,226 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:15:25,226 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:15:25,227 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:15:25,227 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:15:25,227 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:15:25,227 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:15:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-28 20:15:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:15:25,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:25,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:25,254 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 578856491, now seen corresponding path program 1 times [2019-11-28 20:15:25,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:25,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635112933] [2019-11-28 20:15:25,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:25,433 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-28 20:15:25,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635112933] [2019-11-28 20:15:25,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:25,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:15:25,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393980478] [2019-11-28 20:15:25,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:15:25,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:15:25,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:15:25,462 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-11-28 20:15:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:25,616 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-28 20:15:25,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:15:25,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 20:15:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:25,631 INFO L225 Difference]: With dead ends: 50 [2019-11-28 20:15:25,631 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:15:25,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:15:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:15:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:15:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:15:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-11-28 20:15:25,679 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 10 [2019-11-28 20:15:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:25,679 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-11-28 20:15:25,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:15:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-11-28 20:15:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:15:25,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:25,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:25,681 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash 764657291, now seen corresponding path program 1 times [2019-11-28 20:15:25,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:25,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096094836] [2019-11-28 20:15:25,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:15:25,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096094836] [2019-11-28 20:15:25,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:25,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:15:25,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388257774] [2019-11-28 20:15:25,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:15:25,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:15:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:15:25,821 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 5 states. [2019-11-28 20:15:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:26,008 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-11-28 20:15:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:15:26,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:15:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:26,010 INFO L225 Difference]: With dead ends: 51 [2019-11-28 20:15:26,010 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 20:15:26,011 INFO L630 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-28 20:15:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 20:15:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-11-28 20:15:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:15:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-11-28 20:15:26,019 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 11 [2019-11-28 20:15:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:26,020 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-28 20:15:26,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:15:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-11-28 20:15:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:15:26,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:26,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:26,023 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:26,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:26,024 INFO L82 PathProgramCache]: Analyzing trace with hash 764657292, now seen corresponding path program 1 times [2019-11-28 20:15:26,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:26,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606685415] [2019-11-28 20:15:26,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:26,144 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-28 20:15:26,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606685415] [2019-11-28 20:15:26,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:26,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:15:26,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390371337] [2019-11-28 20:15:26,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:15:26,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:15:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:15:26,151 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2019-11-28 20:15:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:26,316 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-28 20:15:26,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:15:26,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:15:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:26,319 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:15:26,319 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:15:26,320 INFO L630 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-28 20:15:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:15:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-11-28 20:15:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:15:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-28 20:15:26,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 11 [2019-11-28 20:15:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:26,340 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-28 20:15:26,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:15:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-28 20:15:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:15:26,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:26,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:26,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2109784215, now seen corresponding path program 1 times [2019-11-28 20:15:26,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:26,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292918110] [2019-11-28 20:15:26,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:26,465 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-28 20:15:26,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292918110] [2019-11-28 20:15:26,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:26,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:15:26,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155663058] [2019-11-28 20:15:26,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:15:26,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:26,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:15:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:15:26,474 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2019-11-28 20:15:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:26,611 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-28 20:15:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:15:26,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 20:15:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:26,614 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:15:26,614 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 20:15:26,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-28 20:15:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 20:15:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2019-11-28 20:15:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:15:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-28 20:15:26,621 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 16 [2019-11-28 20:15:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:26,622 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-28 20:15:26,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:15:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-28 20:15:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:15:26,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:26,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:26,624 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash 978842128, now seen corresponding path program 1 times [2019-11-28 20:15:26,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:26,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233193162] [2019-11-28 20:15:26,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:26,795 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-28 20:15:26,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233193162] [2019-11-28 20:15:26,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:26,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:15:26,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882347606] [2019-11-28 20:15:26,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:15:26,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:15:26,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:15:26,801 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 8 states. [2019-11-28 20:15:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:27,034 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-11-28 20:15:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:15:27,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-28 20:15:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:27,038 INFO L225 Difference]: With dead ends: 89 [2019-11-28 20:15:27,038 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 20:15:27,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:15:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 20:15:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-11-28 20:15:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 20:15:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-28 20:15:27,045 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 17 [2019-11-28 20:15:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:27,046 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-28 20:15:27,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:15:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-28 20:15:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:15:27,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:27,047 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:27,048 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1500988158, now seen corresponding path program 1 times [2019-11-28 20:15:27,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:27,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37143727] [2019-11-28 20:15:27,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:27,129 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-28 20:15:27,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37143727] [2019-11-28 20:15:27,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:27,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:15:27,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721001325] [2019-11-28 20:15:27,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:15:27,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:27,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:15:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:15:27,132 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 7 states. [2019-11-28 20:15:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:27,367 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-28 20:15:27,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:15:27,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 20:15:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:27,369 INFO L225 Difference]: With dead ends: 68 [2019-11-28 20:15:27,369 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:15:27,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:15:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:15:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2019-11-28 20:15:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:15:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-28 20:15:27,376 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 19 [2019-11-28 20:15:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:27,377 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-28 20:15:27,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:15:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-28 20:15:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:15:27,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:27,379 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:27,379 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1500988159, now seen corresponding path program 1 times [2019-11-28 20:15:27,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:27,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588186123] [2019-11-28 20:15:27,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:27,492 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-28 20:15:27,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588186123] [2019-11-28 20:15:27,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:27,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:15:27,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322846722] [2019-11-28 20:15:27,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:15:27,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:27,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:15:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:15:27,495 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2019-11-28 20:15:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:27,776 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-28 20:15:27,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:15:27,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 20:15:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:27,779 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:15:27,779 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:15:27,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:15:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:15:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2019-11-28 20:15:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 20:15:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-28 20:15:27,785 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 19 [2019-11-28 20:15:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:27,786 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-28 20:15:27,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:15:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-28 20:15:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:15:27,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:27,787 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:27,788 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:27,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:27,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2137255130, now seen corresponding path program 1 times [2019-11-28 20:15:27,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:27,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332926413] [2019-11-28 20:15:27,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:27,965 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-28 20:15:27,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332926413] [2019-11-28 20:15:27,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162222879] [2019-11-28 20:15:27,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 20:15:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:28,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 20:15:28,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:28,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:15:28,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:28,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:28,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:15:28,218 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:28,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:28,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:28,226 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-28 20:15:28,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:15:28,281 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:28,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:28,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:15:28,294 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:28,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:28,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:28,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-28 20:15:28,305 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-28 20:15:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:15:28,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2019-11-28 20:15:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803837017] [2019-11-28 20:15:28,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:15:28,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:15:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:15:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:15:28,307 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 12 states. [2019-11-28 20:15:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:28,537 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-11-28 20:15:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:15:28,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-28 20:15:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:28,539 INFO L225 Difference]: With dead ends: 59 [2019-11-28 20:15:28,539 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:15:28,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:15:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:15:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-11-28 20:15:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:15:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-28 20:15:28,551 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-11-28 20:15:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:28,551 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-28 20:15:28,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:15:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-28 20:15:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:15:28,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:28,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:28,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:15:28,756 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1830400864, now seen corresponding path program 1 times [2019-11-28 20:15:28,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:15:28,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362663092] [2019-11-28 20:15:28,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:15:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:15:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:15:28,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:15:28,834 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:15:28,846 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 20:15:28,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:15:28 BoogieIcfgContainer [2019-11-28 20:15:28,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:15:28,861 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:15:28,861 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:15:28,861 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:15:28,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:25" (3/4) ... [2019-11-28 20:15:28,867 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:15:28,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:15:28,869 INFO L168 Benchmark]: Toolchain (without parser) took 5038.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:28,870 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:15:28,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:28,871 INFO L168 Benchmark]: Boogie Preprocessor took 63.40 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:28,872 INFO L168 Benchmark]: RCFGBuilder took 658.16 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:28,873 INFO L168 Benchmark]: TraceAbstraction took 3694.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:28,873 INFO L168 Benchmark]: Witness Printer took 6.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:15:28,884 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.40 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.16 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3694.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] p->h = 1 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L533] p->n = 0 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L534] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L535] COND TRUE p!=0 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L536] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1] [L536] COND FALSE !(p->h != 1) [L539] EXPR p->n VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={0:0}] [L539] p = p->n [L535] COND FALSE !(p!=0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={0:0}] [L541] return 0; VAL [\result=0, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 16 error locations. Result: UNSAFE, OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 233 SDtfs, 531 SDslu, 398 SDs, 0 SdLazy, 890 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 12426 SizeOfPredicates, 11 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 6/8 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 20:15:30,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:15:30,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:15:30,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:15:30,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:15:30,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:15:30,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:15:30,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:15:30,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:15:30,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:15:30,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:15:30,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:15:30,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:15:30,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:15:30,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:15:30,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:15:30,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:15:30,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:15:30,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:15:30,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:15:30,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:15:30,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:15:30,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:15:30,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:15:30,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:15:30,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:15:30,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:15:30,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:15:30,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:15:30,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:15:30,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:15:30,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:15:30,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:15:30,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:15:30,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:15:30,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:15:30,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:15:30,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:15:30,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:15:30,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:15:30,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:15:30,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 20:15:30,940 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:15:30,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:15:30,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:15:30,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:15:30,942 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:15:30,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:15:30,943 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:15:30,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:15:30,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:15:30,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:15:30,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:15:30,944 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:15:30,945 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:15:30,945 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:15:30,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:15:30,945 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:15:30,946 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 20:15:30,946 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 20:15:30,946 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:15:30,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:15:30,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:15:30,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:15:30,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:15:30,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:15:30,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:15:30,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:15:30,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:15:30,949 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 20:15:30,949 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 20:15:30,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:15:30,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 20:15:30,950 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 17ff5ae56efea2deac29e7fa779d53a24810a7c7 [2019-11-28 20:15:31,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:15:31,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:15:31,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:15:31,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:15:31,276 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:15:31,277 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2019-11-28 20:15:31,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f227f868e/ffacd82104144382b07431a1d8be67cc/FLAG06b5df2a2 [2019-11-28 20:15:31,916 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:15:31,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2019-11-28 20:15:31,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f227f868e/ffacd82104144382b07431a1d8be67cc/FLAG06b5df2a2 [2019-11-28 20:15:32,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f227f868e/ffacd82104144382b07431a1d8be67cc [2019-11-28 20:15:32,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:15:32,200 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:15:32,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:15:32,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:15:32,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:15:32,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d98bfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32, skipping insertion in model container [2019-11-28 20:15:32,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:15:32,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:15:32,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:15:32,673 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:15:32,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:15:32,811 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:15:32,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32 WrapperNode [2019-11-28 20:15:32,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:15:32,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:15:32,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:15:32,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:15:32,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... [2019-11-28 20:15:32,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:15:32,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:15:32,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:15:32,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:15:32,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 20:15:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:15:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:15:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 20:15:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:15:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:15:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:15:32,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:15:32,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:15:32,971 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 20:15:32,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:15:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:15:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:15:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:15:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:15:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:15:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:15:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:15:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:15:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:15:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:15:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:15:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:15:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:15:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:15:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:15:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:15:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:15:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:15:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:15:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:15:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:15:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:15:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:15:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:15:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:15:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:15:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:15:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:15:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:15:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:15:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:15:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:15:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:15:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:15:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:15:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:15:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:15:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:15:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:15:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:15:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:15:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:15:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:15:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:15:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:15:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:15:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:15:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:15:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:15:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:15:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:15:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:15:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:15:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:15:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:15:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:15:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:15:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:15:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:15:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:15:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:15:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:15:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:15:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:15:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:15:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:15:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:15:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:15:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:15:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:15:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:15:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:15:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:15:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:15:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:15:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:15:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:15:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:15:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:15:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:15:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:15:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:15:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:15:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:15:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:15:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:15:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:15:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:15:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:15:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:15:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:15:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:15:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:15:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:15:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:15:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:15:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:15:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:15:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:15:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:15:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:15:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:15:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:15:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:15:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:15:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:15:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:15:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:15:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:15:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 20:15:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:15:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:15:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 20:15:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:15:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:15:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 20:15:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:15:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:15:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 20:15:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:15:33,375 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 20:15:33,622 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:15:33,622 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 20:15:33,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:33 BoogieIcfgContainer [2019-11-28 20:15:33,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:15:33,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:15:33,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:15:33,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:15:33,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:15:32" (1/3) ... [2019-11-28 20:15:33,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d56652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:33, skipping insertion in model container [2019-11-28 20:15:33,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:32" (2/3) ... [2019-11-28 20:15:33,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d56652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:33, skipping insertion in model container [2019-11-28 20:15:33,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:33" (3/3) ... [2019-11-28 20:15:33,633 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-2.i [2019-11-28 20:15:33,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:15:33,652 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 20:15:33,665 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 20:15:33,686 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:15:33,687 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:15:33,687 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:15:33,687 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:15:33,687 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:15:33,688 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:15:33,688 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:15:33,688 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:15:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-11-28 20:15:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:15:33,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:33,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:33,716 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:33,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1404783650, now seen corresponding path program 1 times [2019-11-28 20:15:33,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:33,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043671001] [2019-11-28 20:15:33,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:33,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:15:33,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:33,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:15:33,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:33,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:33,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:33,972 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 20:15:33,991 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-28 20:15:33,992 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:15:34,010 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-28 20:15:34,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043671001] [2019-11-28 20:15:34,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:34,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 20:15:34,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484373562] [2019-11-28 20:15:34,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:15:34,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:15:34,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:15:34,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:15:34,039 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2019-11-28 20:15:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:34,288 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-11-28 20:15:34,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:15:34,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:15:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:34,299 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:15:34,299 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 20:15:34,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:15:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 20:15:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-11-28 20:15:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:15:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-11-28 20:15:34,343 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 10 [2019-11-28 20:15:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:34,344 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-11-28 20:15:34,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:15:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-11-28 20:15:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:15:34,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:34,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:34,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 20:15:34,558 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1404783651, now seen corresponding path program 1 times [2019-11-28 20:15:34,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:34,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935845011] [2019-11-28 20:15:34,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:34,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:15:34,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:34,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:15:34,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:34,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:34,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:34,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:15:34,732 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-28 20:15:34,733 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:15:34,837 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-28 20:15:34,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935845011] [2019-11-28 20:15:34,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:34,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-28 20:15:34,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481796083] [2019-11-28 20:15:34,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:15:34,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:15:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:15:34,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:15:34,843 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2019-11-28 20:15:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:35,233 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-28 20:15:35,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:15:35,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-28 20:15:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:35,235 INFO L225 Difference]: With dead ends: 58 [2019-11-28 20:15:35,235 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 20:15:35,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:15:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 20:15:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-11-28 20:15:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:15:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 20:15:35,248 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 10 [2019-11-28 20:15:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:35,250 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 20:15:35,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:15:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 20:15:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:15:35,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:35,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:35,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 20:15:35,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1238965195, now seen corresponding path program 1 times [2019-11-28 20:15:35,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:35,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882347606] [2019-11-28 20:15:35,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:35,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:15:35,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:35,592 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-28 20:15:35,592 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:15:35,602 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-28 20:15:35,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882347606] [2019-11-28 20:15:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:35,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 20:15:35,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52518711] [2019-11-28 20:15:35,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:15:35,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:15:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:15:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:15:35,604 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-11-28 20:15:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:35,771 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-11-28 20:15:35,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:15:35,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 20:15:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:35,773 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:15:35,773 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:15:35,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:15:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:15:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-11-28 20:15:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:15:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-28 20:15:35,781 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2019-11-28 20:15:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:35,781 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-28 20:15:35,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:15:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-28 20:15:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:15:35,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:35,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:35,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 20:15:35,994 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 246825543, now seen corresponding path program 1 times [2019-11-28 20:15:35,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:35,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593330589] [2019-11-28 20:15:35,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:36,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:15:36,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:36,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:15:36,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:36,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:36,138 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:36,139 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-28 20:15:36,172 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 20:15:36,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2019-11-28 20:15:36,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:36,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:36,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:36,177 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:9 [2019-11-28 20:15:36,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:15:36,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:36,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:36,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:36,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2019-11-28 20:15:36,212 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-28 20:15:36,212 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:15:36,224 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:15:36,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:36,230 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:15:36,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-11-28 20:15:36,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2019-11-28 20:15:36,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:36,340 INFO L614 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-11-28 20:15:36,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:15:36,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-28 20:15:36,347 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-28 20:15:36,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593330589] [2019-11-28 20:15:36,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:36,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-28 20:15:36,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827504983] [2019-11-28 20:15:36,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:15:36,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:15:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:15:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:15:36,353 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 8 states. [2019-11-28 20:15:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:36,732 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-11-28 20:15:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:15:36,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 20:15:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:36,735 INFO L225 Difference]: With dead ends: 86 [2019-11-28 20:15:36,736 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 20:15:36,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:15:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 20:15:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 54. [2019-11-28 20:15:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:15:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-28 20:15:36,750 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2019-11-28 20:15:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:36,751 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-28 20:15:36,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:15:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-28 20:15:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:15:36,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:36,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:36,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 20:15:36,954 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash -199427220, now seen corresponding path program 1 times [2019-11-28 20:15:36,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:36,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572120640] [2019-11-28 20:15:36,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:37,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:15:37,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:37,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:15:37,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:37,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 20:15:37,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:15:37,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:37,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,137 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-28 20:15:37,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-28 20:15:37,154 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:37,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-11-28 20:15:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:15:37,182 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:15:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:15:37,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572120640] [2019-11-28 20:15:37,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:37,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 20:15:37,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632579864] [2019-11-28 20:15:37,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:15:37,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:15:37,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:15:37,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:15:37,204 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2019-11-28 20:15:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:37,568 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-28 20:15:37,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:15:37,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-28 20:15:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:37,571 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:15:37,571 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 20:15:37,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:15:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 20:15:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2019-11-28 20:15:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:15:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-28 20:15:37,578 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 17 [2019-11-28 20:15:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:37,578 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-28 20:15:37,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:15:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-28 20:15:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:15:37,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:37,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:37,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 20:15:37,781 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash -199427219, now seen corresponding path program 1 times [2019-11-28 20:15:37,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:37,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150910964] [2019-11-28 20:15:37,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:37,872 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:15:37,874 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:37,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:15:37,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:37,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,904 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:15:37,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:15:37,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:37,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:15:37,944 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,956 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:37,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,957 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-28 20:15:37,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-28 20:15:37,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:37,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:37,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-28 20:15:37,999 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:38,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:38,005 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:38,006 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-28 20:15:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:15:38,034 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:15:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:15:38,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150910964] [2019-11-28 20:15:38,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:15:38,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 20:15:38,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217445483] [2019-11-28 20:15:38,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:15:38,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:15:38,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:15:38,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:15:38,224 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2019-11-28 20:15:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:39,166 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-28 20:15:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:15:39,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-28 20:15:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:39,171 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:15:39,172 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 20:15:39,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:15:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 20:15:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-28 20:15:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 20:15:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 20:15:39,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 17 [2019-11-28 20:15:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:39,177 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 20:15:39,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:15:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 20:15:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:15:39,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:39,179 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:39,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 20:15:39,384 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash 200611076, now seen corresponding path program 1 times [2019-11-28 20:15:39,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:39,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217782371] [2019-11-28 20:15:39,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:15:39,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:15:39,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:15:39,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:15:39,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:39,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:39,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:15:39,517 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:39,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:39,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:39,526 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-28 20:15:39,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-28 20:15:39,579 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:39,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:39,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-28 20:15:39,594 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:15:39,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:15:39,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:15:39,599 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-11-28 20:15:39,637 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-28 20:15:39,637 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:15:39,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2019-11-28 20:15:39,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 20:15:39,679 INFO L614 ElimStorePlain]: treesize reduction 19, result has 36.7 percent of original size [2019-11-28 20:15:39,679 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-11-28 20:15:39,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:15:39,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2019-11-28 20:15:39,690 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-28 20:15:39,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217782371] [2019-11-28 20:15:39,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:15:39,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 20:15:39,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926240586] [2019-11-28 20:15:39,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:15:39,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:15:39,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:15:39,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:15:39,693 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 7 states. [2019-11-28 20:15:41,898 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-11-28 20:15:44,066 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-11-28 20:15:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:15:44,206 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 20:15:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:15:44,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 20:15:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:15:44,208 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:15:44,208 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 20:15:44,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:15:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 20:15:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2019-11-28 20:15:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:15:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 20:15:44,213 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 19 [2019-11-28 20:15:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:15:44,214 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 20:15:44,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:15:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 20:15:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:15:44,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:15:44,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:15:44,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 20:15:44,416 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:15:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:15:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1923974807, now seen corresponding path program 1 times [2019-11-28 20:15:44,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:15:44,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367884839] [2019-11-28 20:15:44,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 20:15:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:15:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:15:44,575 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-28 20:15:44,575 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:15:44,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 20:15:44,788 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 20:15:44,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:15:44 BoogieIcfgContainer [2019-11-28 20:15:44,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:15:44,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:15:44,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:15:44,807 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:15:44,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:33" (3/4) ... [2019-11-28 20:15:44,810 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:15:44,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:15:44,812 INFO L168 Benchmark]: Toolchain (without parser) took 12611.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 956.3 MB in the beginning and 951.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:44,812 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:15:44,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:44,814 INFO L168 Benchmark]: Boogie Preprocessor took 93.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:44,815 INFO L168 Benchmark]: RCFGBuilder took 717.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:44,815 INFO L168 Benchmark]: TraceAbstraction took 11180.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 122.9 MB). Peak memory consumption was 189.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:15:44,816 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 1.2 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:15:44,819 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 717.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11180.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 122.9 MB). Peak memory consumption was 189.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 1.2 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L522] COND FALSE !(a == 0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L523] List t; [L524] List p = a; VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] p->h = 1 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L533] p->n = 0 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L534] p = a VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L535] COND TRUE p!=0 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L536] EXPR p->h VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=1] [L536] COND FALSE !(p->h != 1) [L539] EXPR p->n VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}, p->n={0:0}] [L539] p = p->n [L535] COND FALSE !(p!=0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={0:0}] [L541] return 0; VAL [\result=0, a={1:0}, malloc(sizeof(struct node))={1:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 71 locations, 16 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 191 SDtfs, 434 SDslu, 470 SDs, 0 SdLazy, 619 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 194 ConstructedInterpolants, 1 QuantifiedInterpolants, 14092 SizeOfPredicates, 49 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 6/8 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...