./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 7c71bc25 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-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 14:06:25,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 14:06:25,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 14:06:25,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 14:06:25,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 14:06:25,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 14:06:25,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 14:06:25,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 14:06:25,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 14:06:25,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 14:06:25,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 14:06:25,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 14:06:25,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 14:06:25,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 14:06:25,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 14:06:25,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 14:06:25,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 14:06:25,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 14:06:25,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 14:06:25,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 14:06:25,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 14:06:25,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 14:06:25,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 14:06:25,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 14:06:25,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 14:06:25,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 14:06:25,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 14:06:25,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 14:06:25,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 14:06:25,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 14:06:25,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 14:06:25,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 14:06:25,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 14:06:25,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 14:06:25,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 14:06:25,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 14:06:25,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 14:06:25,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 14:06:25,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 14:06:25,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 14:06:25,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 14:06:25,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-25 14:06:25,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 14:06:25,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 14:06:25,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 14:06:25,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 14:06:25,579 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 14:06:25,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 14:06:25,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 14:06:25,580 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 14:06:25,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 14:06:25,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 14:06:25,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 14:06:25,581 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 14:06:25,582 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 14:06:25,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 14:06:25,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 14:06:25,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 14:06:25,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 14:06:25,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 14:06:25,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 14:06:25,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 14:06:25,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 14:06:25,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 14:06:25,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 14:06:25,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 14:06:25,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 14:06:25,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 14:06:25,586 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-memcleanup) ) 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 -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-25 14:06:25,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 14:06:25,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 14:06:25,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 14:06:25,894 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 14:06:25,894 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 14:06:25,895 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-25 14:06:25,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a3f2086/e05f8ec1676d46f9b6e2d28b7e4fa431/FLAGdb88c7f94 [2019-11-25 14:06:26,432 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 14:06:26,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-25 14:06:26,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a3f2086/e05f8ec1676d46f9b6e2d28b7e4fa431/FLAGdb88c7f94 [2019-11-25 14:06:26,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a3f2086/e05f8ec1676d46f9b6e2d28b7e4fa431 [2019-11-25 14:06:26,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 14:06:26,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 14:06:26,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 14:06:26,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 14:06:26,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 14:06:26,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:06:26" (1/1) ... [2019-11-25 14:06:26,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b7244d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:26, skipping insertion in model container [2019-11-25 14:06:26,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:06:26" (1/1) ... [2019-11-25 14:06:26,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 14:06:26,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 14:06:27,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:06:27,354 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 14:06:27,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:06:27,453 INFO L208 MainTranslator]: Completed translation [2019-11-25 14:06:27,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27 WrapperNode [2019-11-25 14:06:27,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 14:06:27,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 14:06:27,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 14:06:27,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 14:06:27,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (1/1) ... [2019-11-25 14:06:27,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (1/1) ... [2019-11-25 14:06:27,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (1/1) ... [2019-11-25 14:06:27,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (1/1) ... [2019-11-25 14:06:27,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (1/1) ... [2019-11-25 14:06:27,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (1/1) ... [2019-11-25 14:06:27,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (1/1) ... [2019-11-25 14:06:27,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 14:06:27,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 14:06:27,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 14:06:27,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 14:06:27,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (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-25 14:06:27,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 14:06:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 14:06:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 14:06:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 14:06:27,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 14:06:27,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 14:06:27,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 14:06:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-25 14:06:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 14:06:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 14:06:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 14:06:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 14:06:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 14:06:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 14:06:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 14:06:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 14:06:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 14:06:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 14:06:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 14:06:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 14:06:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 14:06:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 14:06:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 14:06:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 14:06:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 14:06:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 14:06:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 14:06:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 14:06:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 14:06:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 14:06:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 14:06:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 14:06:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 14:06:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 14:06:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 14:06:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 14:06:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 14:06:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 14:06:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 14:06:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 14:06:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 14:06:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 14:06:27,594 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 14:06:27,594 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 14:06:27,594 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 14:06:27,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 14:06:27,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 14:06:27,596 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 14:06:27,596 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 14:06:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 14:06:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 14:06:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 14:06:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 14:06:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 14:06:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 14:06:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 14:06:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 14:06:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 14:06:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 14:06:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 14:06:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 14:06:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 14:06:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 14:06:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 14:06:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 14:06:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 14:06:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 14:06:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 14:06:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 14:06:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 14:06:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 14:06:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 14:06:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 14:06:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 14:06:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 14:06:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 14:06:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 14:06:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 14:06:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 14:06:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 14:06:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 14:06:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 14:06:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 14:06:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 14:06:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 14:06:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 14:06:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 14:06:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 14:06:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 14:06:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 14:06:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 14:06:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 14:06:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 14:06:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 14:06:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 14:06:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 14:06:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 14:06:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 14:06:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 14:06:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 14:06:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 14:06:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 14:06:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 14:06:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 14:06:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 14:06:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 14:06:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 14:06:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 14:06:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 14:06:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 14:06:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 14:06:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 14:06:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 14:06:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 14:06:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 14:06:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 14:06:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 14:06:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 14:06:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-25 14:06:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 14:06:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 14:06:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 14:06:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 14:06:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 14:06:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 14:06:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 14:06:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 14:06:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 14:06:27,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-25 14:06:28,198 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 14:06:28,198 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-25 14:06:28,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:28 BoogieIcfgContainer [2019-11-25 14:06:28,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 14:06:28,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 14:06:28,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 14:06:28,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 14:06:28,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 02:06:26" (1/3) ... [2019-11-25 14:06:28,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc24859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:06:28, skipping insertion in model container [2019-11-25 14:06:28,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:27" (2/3) ... [2019-11-25 14:06:28,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc24859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:06:28, skipping insertion in model container [2019-11-25 14:06:28,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:28" (3/3) ... [2019-11-25 14:06:28,209 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-ext.i [2019-11-25 14:06:28,220 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 14:06:28,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-25 14:06:28,244 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-25 14:06:28,266 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 14:06:28,276 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 14:06:28,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 14:06:28,277 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 14:06:28,277 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 14:06:28,277 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 14:06:28,277 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 14:06:28,277 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 14:06:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-25 14:06:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 14:06:28,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:28,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:28,309 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -746638641, now seen corresponding path program 1 times [2019-11-25 14:06:28,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:28,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808068388] [2019-11-25 14:06:28,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,498 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-25 14:06:28,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808068388] [2019-11-25 14:06:28,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:28,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 14:06:28,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787335197] [2019-11-25 14:06:28,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 14:06:28,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 14:06:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 14:06:28,523 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2019-11-25 14:06:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:28,678 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-25 14:06:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 14:06:28,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 14:06:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:28,690 INFO L225 Difference]: With dead ends: 62 [2019-11-25 14:06:28,691 INFO L226 Difference]: Without dead ends: 54 [2019-11-25 14:06:28,696 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-25 14:06:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-25 14:06:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-25 14:06:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 14:06:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-25 14:06:28,748 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 10 [2019-11-25 14:06:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:28,748 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-25 14:06:28,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 14:06:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-25 14:06:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 14:06:28,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:28,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:28,750 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:28,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash -261147736, now seen corresponding path program 1 times [2019-11-25 14:06:28,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:28,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394726182] [2019-11-25 14:06:28,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,876 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-25 14:06:28,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394726182] [2019-11-25 14:06:28,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:28,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 14:06:28,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215237907] [2019-11-25 14:06:28,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 14:06:28,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:28,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 14:06:28,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 14:06:28,884 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 5 states. [2019-11-25 14:06:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:29,080 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-11-25 14:06:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 14:06:29,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-25 14:06:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:29,082 INFO L225 Difference]: With dead ends: 72 [2019-11-25 14:06:29,082 INFO L226 Difference]: Without dead ends: 72 [2019-11-25 14:06:29,083 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-25 14:06:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-25 14:06:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2019-11-25 14:06:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 14:06:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-25 14:06:29,097 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 12 [2019-11-25 14:06:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:29,098 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-25 14:06:29,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 14:06:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-25 14:06:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 14:06:29,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:29,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:29,099 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash -261147735, now seen corresponding path program 1 times [2019-11-25 14:06:29,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:29,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116035286] [2019-11-25 14:06:29,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 14:06:29,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116035286] [2019-11-25 14:06:29,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:29,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 14:06:29,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061305312] [2019-11-25 14:06:29,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 14:06:29,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 14:06:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 14:06:29,237 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-25 14:06:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:29,476 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-25 14:06:29,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 14:06:29,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-25 14:06:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:29,481 INFO L225 Difference]: With dead ends: 77 [2019-11-25 14:06:29,481 INFO L226 Difference]: Without dead ends: 77 [2019-11-25 14:06:29,482 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-25 14:06:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-25 14:06:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-11-25 14:06:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 14:06:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-11-25 14:06:29,494 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 12 [2019-11-25 14:06:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:29,494 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-11-25 14:06:29,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 14:06:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-11-25 14:06:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 14:06:29,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:29,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:29,497 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1733653831, now seen corresponding path program 1 times [2019-11-25 14:06:29,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:29,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068285361] [2019-11-25 14:06:29,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:29,606 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-25 14:06:29,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068285361] [2019-11-25 14:06:29,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:29,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:06:29,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086692067] [2019-11-25 14:06:29,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 14:06:29,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:29,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 14:06:29,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 14:06:29,609 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2019-11-25 14:06:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:29,783 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-25 14:06:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 14:06:29,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-25 14:06:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:29,785 INFO L225 Difference]: With dead ends: 73 [2019-11-25 14:06:29,785 INFO L226 Difference]: Without dead ends: 73 [2019-11-25 14:06:29,786 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-25 14:06:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-25 14:06:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-11-25 14:06:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 14:06:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-11-25 14:06:29,797 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 19 [2019-11-25 14:06:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:29,798 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-11-25 14:06:29,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 14:06:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-11-25 14:06:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 14:06:29,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:29,801 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:29,801 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:29,801 INFO L82 PathProgramCache]: Analyzing trace with hash 838007822, now seen corresponding path program 1 times [2019-11-25 14:06:29,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:29,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462811277] [2019-11-25 14:06:29,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:29,985 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-25 14:06:29,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462811277] [2019-11-25 14:06:29,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:29,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 14:06:29,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113736372] [2019-11-25 14:06:29,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:06:29,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:06:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:06:29,988 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 8 states. [2019-11-25 14:06:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:30,260 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-11-25 14:06:30,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 14:06:30,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 14:06:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:30,262 INFO L225 Difference]: With dead ends: 82 [2019-11-25 14:06:30,262 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 14:06:30,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-25 14:06:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 14:06:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-25 14:06:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 14:06:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-25 14:06:30,274 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 21 [2019-11-25 14:06:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:30,274 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-25 14:06:30,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:06:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-25 14:06:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 14:06:30,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:30,280 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:30,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942662, now seen corresponding path program 1 times [2019-11-25 14:06:30,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:30,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273823285] [2019-11-25 14:06:30,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 14:06:30,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273823285] [2019-11-25 14:06:30,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:30,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:06:30,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087472951] [2019-11-25 14:06:30,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:06:30,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:06:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:06:30,359 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-11-25 14:06:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:30,575 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-25 14:06:30,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 14:06:30,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 14:06:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:30,577 INFO L225 Difference]: With dead ends: 66 [2019-11-25 14:06:30,577 INFO L226 Difference]: Without dead ends: 66 [2019-11-25 14:06:30,577 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-25 14:06:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-25 14:06:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-25 14:06:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 14:06:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-25 14:06:30,582 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2019-11-25 14:06:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:30,582 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-25 14:06:30,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:06:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-25 14:06:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 14:06:30,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:30,583 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:30,584 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942661, now seen corresponding path program 1 times [2019-11-25 14:06:30,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:30,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742712276] [2019-11-25 14:06:30,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 14:06:30,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742712276] [2019-11-25 14:06:30,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:30,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:06:30,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80618908] [2019-11-25 14:06:30,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:06:30,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:30,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:06:30,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:06:30,714 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 7 states. [2019-11-25 14:06:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:31,030 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-25 14:06:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:06:31,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 14:06:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:31,031 INFO L225 Difference]: With dead ends: 59 [2019-11-25 14:06:31,031 INFO L226 Difference]: Without dead ends: 59 [2019-11-25 14:06:31,032 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-25 14:06:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-25 14:06:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-25 14:06:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 14:06:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-25 14:06:31,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 21 [2019-11-25 14:06:31,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:31,037 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-25 14:06:31,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:06:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-25 14:06:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 14:06:31,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:31,038 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:31,039 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:31,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:31,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1979195964, now seen corresponding path program 1 times [2019-11-25 14:06:31,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:31,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438865900] [2019-11-25 14:06:31,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 14:06:31,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438865900] [2019-11-25 14:06:31,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134340221] [2019-11-25 14:06:31,262 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-25 14:06:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:31,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-25 14:06:31,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:31,470 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-25 14:06:31,470 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,477 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,478 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 14:06:31,541 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-25 14:06:31,542 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,552 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,552 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-25 14:06:31,594 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 14:06:31,595 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,605 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,605 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-25 14:06:31,638 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|], 2=[|v_#memory_int_13|]} [2019-11-25 14:06:31,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 14:06:31,644 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,661 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 14:06:31,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 14:06:31,670 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,682 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,683 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-11-25 14:06:31,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 14:06:31,734 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,743 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,743 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-25 14:06:31,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 14:06:31,809 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,818 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,819 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-11-25 14:06:31,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 14:06:31,828 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,835 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,836 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-11-25 14:06:31,888 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-25 14:06:31,889 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,894 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,895 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-25 14:06:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 14:06:31,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:06:31,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-25 14:06:31,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415513521] [2019-11-25 14:06:31,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 14:06:31,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 14:06:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-11-25 14:06:31,920 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 22 states. [2019-11-25 14:06:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:32,620 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-11-25 14:06:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 14:06:32,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-25 14:06:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:32,621 INFO L225 Difference]: With dead ends: 83 [2019-11-25 14:06:32,621 INFO L226 Difference]: Without dead ends: 77 [2019-11-25 14:06:32,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-11-25 14:06:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-25 14:06:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-11-25 14:06:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 14:06:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-25 14:06:32,627 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 30 [2019-11-25 14:06:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:32,628 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-25 14:06:32,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 14:06:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-25 14:06:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 14:06:32,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:32,629 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:32,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:32,839 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 14:06:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:32,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1282404402, now seen corresponding path program 2 times [2019-11-25 14:06:32,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:32,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340263715] [2019-11-25 14:06:32,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 14:06:33,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340263715] [2019-11-25 14:06:33,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156604815] [2019-11-25 14:06:33,197 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:33,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 14:06:33,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 14:06:33,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-25 14:06:33,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:33,349 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-25 14:06:33,352 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,357 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,358 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 14:06:33,425 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 14:06:33,426 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,434 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,434 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-25 14:06:33,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 14:06:33,479 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,490 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,491 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-25 14:06:33,621 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-25 14:06:33,621 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 35 treesize of output 27 [2019-11-25 14:06:33,622 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,641 INFO L588 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-25 14:06:33,641 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-25 14:06:33,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 14:06:33,676 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,684 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,685 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-25 14:06:33,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-25 14:06:33,755 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,785 INFO L588 ElimStorePlain]: treesize reduction 34, result has 50.7 percent of original size [2019-11-25 14:06:33,786 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2019-11-25 14:06:34,034 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-25 14:06:34,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2019-11-25 14:06:34,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,045 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 14:06:34,105 INFO L588 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-25 14:06:34,107 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 14:06:34,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:54 [2019-11-25 14:06:34,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:34,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 65 [2019-11-25 14:06:34,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,209 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-25 14:06:34,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:34,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 131 [2019-11-25 14:06:34,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,339 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-25 14:06:34,493 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-11-25 14:06:34,494 INFO L588 ElimStorePlain]: treesize reduction 1285, result has 7.4 percent of original size [2019-11-25 14:06:34,495 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-25 14:06:34,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:103 [2019-11-25 14:06:34,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:34,693 INFO L404 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[v_prenex_4]} [2019-11-25 14:06:34,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:34,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-11-25 14:06:34,703 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:34,740 INFO L588 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-11-25 14:06:34,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:34,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2019-11-25 14:06:34,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 14:06:34,764 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:34,788 INFO L588 ElimStorePlain]: treesize reduction 83, result has 20.2 percent of original size [2019-11-25 14:06:34,789 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:34,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:97, output treesize:5 [2019-11-25 14:06:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 14:06:34,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:06:34,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-11-25 14:06:34,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374719262] [2019-11-25 14:06:34,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-25 14:06:34,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-25 14:06:34,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-11-25 14:06:34,860 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 31 states. [2019-11-25 14:06:36,402 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-11-25 14:06:36,693 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-11-25 14:06:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:37,152 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-25 14:06:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-25 14:06:37,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-11-25 14:06:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:37,153 INFO L225 Difference]: With dead ends: 56 [2019-11-25 14:06:37,153 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 14:06:37,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=391, Invalid=2261, Unknown=0, NotChecked=0, Total=2652 [2019-11-25 14:06:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 14:06:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 14:06:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 14:06:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 14:06:37,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-11-25 14:06:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:37,156 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 14:06:37,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-25 14:06:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 14:06:37,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 14:06:37,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:37,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 02:06:37 BoogieIcfgContainer [2019-11-25 14:06:37,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 14:06:37,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 14:06:37,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 14:06:37,364 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 14:06:37,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:28" (3/4) ... [2019-11-25 14:06:37,368 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 14:06:37,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 14:06:37,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-25 14:06:37,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 14:06:37,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 14:06:37,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 14:06:37,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 14:06:37,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 14:06:37,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 14:06:37,387 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 14:06:37,388 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-25 14:06:37,388 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 14:06:37,388 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 14:06:37,452 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 14:06:37,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 14:06:37,455 INFO L168 Benchmark]: Toolchain (without parser) took 10673.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 961.7 MB in the beginning and 885.1 MB in the end (delta: 76.6 MB). Peak memory consumption was 371.2 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:37,456 INFO L168 Benchmark]: CDTParser took 0.24 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-25 14:06:37,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:37,457 INFO L168 Benchmark]: Boogie Preprocessor took 62.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:37,457 INFO L168 Benchmark]: RCFGBuilder took 681.18 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:37,458 INFO L168 Benchmark]: TraceAbstraction took 9162.61 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 894.7 MB in the end (delta: 135.3 MB). Peak memory consumption was 321.4 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:37,458 INFO L168 Benchmark]: Witness Printer took 90.53 ms. Allocated memory is still 1.3 GB. Free memory was 894.7 MB in the beginning and 885.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:37,460 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.24 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 671.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 681.18 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9162.61 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 894.7 MB in the end (delta: 135.3 MB). Peak memory consumption was 321.4 MB. Max. memory is 11.5 GB. * Witness Printer took 90.53 ms. Allocated memory is still 1.3 GB. Free memory was 894.7 MB in the beginning and 885.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 78 locations, 20 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 290 SDtfs, 679 SDslu, 919 SDs, 0 SdLazy, 1964 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, 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, 9 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 243 ConstructedInterpolants, 11 QuantifiedInterpolants, 93365 SizeOfPredicates, 33 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 14/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...