./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 10:23:17,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 10:23:17,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 10:23:17,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 10:23:17,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 10:23:17,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 10:23:17,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 10:23:17,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 10:23:17,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 10:23:17,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 10:23:17,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 10:23:17,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 10:23:17,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 10:23:17,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 10:23:17,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 10:23:17,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 10:23:17,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 10:23:17,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 10:23:17,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 10:23:17,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 10:23:17,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 10:23:17,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 10:23:17,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 10:23:17,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 10:23:17,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 10:23:17,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 10:23:17,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 10:23:17,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 10:23:17,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 10:23:17,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 10:23:17,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 10:23:17,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 10:23:17,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 10:23:17,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 10:23:17,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 10:23:17,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 10:23:17,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 10:23:17,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 10:23:17,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 10:23:17,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 10:23:17,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 10:23:17,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-22 10:23:17,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 10:23:17,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 10:23:17,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 10:23:17,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 10:23:17,662 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 10:23:17,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 10:23:17,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 10:23:17,662 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 10:23:17,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 10:23:17,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 10:23:17,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 10:23:17,663 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 10:23:17,663 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 10:23:17,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 10:23:17,664 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 10:23:17,664 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 10:23:17,664 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 10:23:17,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 10:23:17,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 10:23:17,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 10:23:17,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 10:23:17,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 10:23:17,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 10:23:17,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 10:23:17,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 10:23:17,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 10:23:17,666 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 10:23:17,667 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 10:23:17,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 10:23:17,667 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-22 10:23:17,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 10:23:17,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 10:23:17,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 10:23:17,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 10:23:17,986 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 10:23:17,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 10:23:18,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9928b2722/ae570cdab60f41968ee6a67df448cb78/FLAG8a461460b [2019-11-22 10:23:18,519 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 10:23:18,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 10:23:18,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9928b2722/ae570cdab60f41968ee6a67df448cb78/FLAG8a461460b [2019-11-22 10:23:18,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9928b2722/ae570cdab60f41968ee6a67df448cb78 [2019-11-22 10:23:18,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 10:23:18,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 10:23:18,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 10:23:18,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 10:23:18,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 10:23:18,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:23:18" (1/1) ... [2019-11-22 10:23:18,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:18, skipping insertion in model container [2019-11-22 10:23:18,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:23:18" (1/1) ... [2019-11-22 10:23:18,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 10:23:18,982 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 10:23:19,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:23:19,382 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 10:23:19,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 10:23:19,535 INFO L205 MainTranslator]: Completed translation [2019-11-22 10:23:19,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19 WrapperNode [2019-11-22 10:23:19,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 10:23:19,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 10:23:19,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 10:23:19,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 10:23:19,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (1/1) ... [2019-11-22 10:23:19,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (1/1) ... [2019-11-22 10:23:19,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (1/1) ... [2019-11-22 10:23:19,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (1/1) ... [2019-11-22 10:23:19,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (1/1) ... [2019-11-22 10:23:19,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (1/1) ... [2019-11-22 10:23:19,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (1/1) ... [2019-11-22 10:23:19,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 10:23:19,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 10:23:19,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 10:23:19,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 10:23:19,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (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-22 10:23:19,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 10:23:19,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 10:23:19,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:23:19,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 10:23:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 10:23:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 10:23:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 10:23:19,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 10:23:19,711 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 10:23:19,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 10:23:19,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 10:23:19,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 10:23:19,712 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 10:23:19,712 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 10:23:19,712 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 10:23:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 10:23:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 10:23:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 10:23:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 10:23:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 10:23:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 10:23:19,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 10:23:19,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 10:23:19,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 10:23:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 10:23:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 10:23:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 10:23:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 10:23:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 10:23:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 10:23:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 10:23:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 10:23:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 10:23:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 10:23:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 10:23:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 10:23:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 10:23:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 10:23:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 10:23:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 10:23:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 10:23:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 10:23:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 10:23:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 10:23:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 10:23:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 10:23:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 10:23:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 10:23:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 10:23:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 10:23:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 10:23:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 10:23:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 10:23:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 10:23:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 10:23:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 10:23:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 10:23:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 10:23:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 10:23:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 10:23:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 10:23:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 10:23:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 10:23:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 10:23:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 10:23:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 10:23:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 10:23:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 10:23:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 10:23:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 10:23:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 10:23:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 10:23:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 10:23:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 10:23:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 10:23:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 10:23:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 10:23:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 10:23:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 10:23:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 10:23:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 10:23:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 10:23:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 10:23:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 10:23:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 10:23:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 10:23:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 10:23:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 10:23:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 10:23:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 10:23:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 10:23:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 10:23:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 10:23:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 10:23:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 10:23:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 10:23:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 10:23:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 10:23:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 10:23:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 10:23:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 10:23:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 10:23:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 10:23:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 10:23:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 10:23:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 10:23:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 10:23:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 10:23:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 10:23:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 10:23:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 10:23:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 10:23:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 10:23:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 10:23:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 10:23:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 10:23:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 10:23:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 10:23:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 10:23:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 10:23:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 10:23:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 10:23:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 10:23:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 10:23:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 10:23:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 10:23:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 10:23:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 10:23:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 10:23:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:23:20,162 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 10:23:20,568 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 10:23:20,568 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 10:23:20,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:20 BoogieIcfgContainer [2019-11-22 10:23:20,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 10:23:20,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 10:23:20,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 10:23:20,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 10:23:20,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:23:18" (1/3) ... [2019-11-22 10:23:20,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dae867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:23:20, skipping insertion in model container [2019-11-22 10:23:20,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:19" (2/3) ... [2019-11-22 10:23:20,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dae867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:23:20, skipping insertion in model container [2019-11-22 10:23:20,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:20" (3/3) ... [2019-11-22 10:23:20,595 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-22 10:23:20,606 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 10:23:20,618 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-22 10:23:20,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-22 10:23:20,655 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 10:23:20,656 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 10:23:20,656 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 10:23:20,656 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 10:23:20,656 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 10:23:20,657 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 10:23:20,657 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 10:23:20,657 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 10:23:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-22 10:23:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:23:20,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:20,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:20,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash 889902328, now seen corresponding path program 1 times [2019-11-22 10:23:20,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:20,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [811081708] [2019-11-22 10:23:20,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:20,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:23:20,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:21,073 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-22 10:23:21,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:21,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:21,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:21,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:23:21,112 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-22 10:23:21,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:21,136 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-22 10:23:21,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [811081708] [2019-11-22 10:23:21,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:21,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:23:21,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037087229] [2019-11-22 10:23:21,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:23:21,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:21,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:23:21,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:23:21,172 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-22 10:23:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:21,592 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-22 10:23:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:23:21,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 10:23:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:21,607 INFO L225 Difference]: With dead ends: 99 [2019-11-22 10:23:21,608 INFO L226 Difference]: Without dead ends: 91 [2019-11-22 10:23:21,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:23:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-22 10:23:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-22 10:23:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-22 10:23:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-22 10:23:21,689 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-22 10:23:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:21,690 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-22 10:23:21,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:23:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-22 10:23:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 10:23:21,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:21,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:21,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:21,899 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash 889902329, now seen corresponding path program 1 times [2019-11-22 10:23:21,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:21,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [869747791] [2019-11-22 10:23:21,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:22,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 10:23:22,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:22,106 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-22 10:23:22,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:22,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:22,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:22,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:23:22,151 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-22 10:23:22,151 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:22,257 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-22 10:23:22,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [869747791] [2019-11-22 10:23:22,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:22,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 10:23:22,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187093582] [2019-11-22 10:23:22,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 10:23:22,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:22,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 10:23:22,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 10:23:22,261 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-22 10:23:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:22,759 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-22 10:23:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 10:23:22,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 10:23:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:22,762 INFO L225 Difference]: With dead ends: 95 [2019-11-22 10:23:22,763 INFO L226 Difference]: Without dead ends: 95 [2019-11-22 10:23:22,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:23:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-22 10:23:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-22 10:23:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-22 10:23:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-22 10:23:22,774 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-22 10:23:22,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:22,775 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-22 10:23:22,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 10:23:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-22 10:23:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 10:23:22,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:22,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:22,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:22,981 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -525648670, now seen corresponding path program 1 times [2019-11-22 10:23:22,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:22,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [102366641] [2019-11-22 10:23:22,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:23,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 10:23:23,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:23,192 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-22 10:23:23,192 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:23,202 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-22 10:23:23,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [102366641] [2019-11-22 10:23:23,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:23,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:23:23,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240543331] [2019-11-22 10:23:23,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:23:23,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:23:23,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:23:23,205 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 4 states. [2019-11-22 10:23:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:23,532 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-22 10:23:23,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:23:23,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 10:23:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:23,538 INFO L225 Difference]: With dead ends: 91 [2019-11-22 10:23:23,538 INFO L226 Difference]: Without dead ends: 91 [2019-11-22 10:23:23,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:23:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-22 10:23:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-22 10:23:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-22 10:23:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-22 10:23:23,552 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-22 10:23:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:23,554 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-22 10:23:23,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:23:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-22 10:23:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:23:23,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:23,556 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-22 10:23:23,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:23,756 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash 884806317, now seen corresponding path program 1 times [2019-11-22 10:23:23,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:23,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [687103796] [2019-11-22 10:23:23,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:23,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:23:23,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:23,956 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-22 10:23:23,956 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:23,972 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-22 10:23:23,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [687103796] [2019-11-22 10:23:23,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:23,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:23:23,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889601699] [2019-11-22 10:23:23,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 10:23:23,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 10:23:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:23:23,977 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-22 10:23:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:24,244 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-22 10:23:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:23:24,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 10:23:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:24,247 INFO L225 Difference]: With dead ends: 95 [2019-11-22 10:23:24,247 INFO L226 Difference]: Without dead ends: 95 [2019-11-22 10:23:24,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:23:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-22 10:23:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-22 10:23:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-22 10:23:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-22 10:23:24,256 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-22 10:23:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:24,256 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-22 10:23:24,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 10:23:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-22 10:23:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:23:24,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:24,257 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-22 10:23:24,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:24,468 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2141888629, now seen corresponding path program 1 times [2019-11-22 10:23:24,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:24,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [957402150] [2019-11-22 10:23:24,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:24,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 10:23:24,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:24,667 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:24,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957402150] [2019-11-22 10:23:24,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:24,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 10:23:24,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281003453] [2019-11-22 10:23:24,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 10:23:24,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 10:23:24,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:23:24,688 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 4 states. [2019-11-22 10:23:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:24,728 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-11-22 10:23:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 10:23:24,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-22 10:23:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:24,732 INFO L225 Difference]: With dead ends: 137 [2019-11-22 10:23:24,732 INFO L226 Difference]: Without dead ends: 137 [2019-11-22 10:23:24,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 10:23:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-22 10:23:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 96. [2019-11-22 10:23:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-22 10:23:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2019-11-22 10:23:24,750 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 19 [2019-11-22 10:23:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:24,751 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2019-11-22 10:23:24,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 10:23:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2019-11-22 10:23:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:23:24,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:24,754 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-22 10:23:24,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:24,956 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:24,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1857254037, now seen corresponding path program 1 times [2019-11-22 10:23:24,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:24,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1653127243] [2019-11-22 10:23:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:25,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 10:23:25,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:25,197 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-22 10:23:25,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:25,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:25,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:25,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-22 10:23:25,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-22 10:23:25,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:25,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:25,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:25,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-22 10:23:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:25,267 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:25,316 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 16 treesize of output 12 [2019-11-22 10:23:25,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 10:23:25,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:25,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-22 10:23:25,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-22 10:23:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:25,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1653127243] [2019-11-22 10:23:25,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:25,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-22 10:23:25,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442780522] [2019-11-22 10:23:25,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 10:23:25,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 10:23:25,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-22 10:23:25,361 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 11 states. [2019-11-22 10:23:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:26,301 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2019-11-22 10:23:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 10:23:26,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-22 10:23:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:26,303 INFO L225 Difference]: With dead ends: 194 [2019-11-22 10:23:26,303 INFO L226 Difference]: Without dead ends: 188 [2019-11-22 10:23:26,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-22 10:23:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-22 10:23:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2019-11-22 10:23:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 10:23:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-22 10:23:26,323 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-22 10:23:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:26,327 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-22 10:23:26,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 10:23:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-22 10:23:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:23:26,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:26,328 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-22 10:23:26,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:26,529 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1662752270, now seen corresponding path program 1 times [2019-11-22 10:23:26,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:26,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1545894541] [2019-11-22 10:23:26,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:26,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 10:23:26,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:26,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:26,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-22 10:23:26,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:26,770 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-22 10:23:26,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:26,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 10:23:26,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 10:23:26,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:26,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:26,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:26,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-22 10:23:26,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-22 10:23:26,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:26,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:26,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:26,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-22 10:23:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:26,865 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:26,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1545894541] [2019-11-22 10:23:26,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:26,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-22 10:23:26,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237168155] [2019-11-22 10:23:26,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 10:23:26,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:26,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 10:23:26,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:23:26,897 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-22 10:23:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:27,478 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-22 10:23:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 10:23:27,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-22 10:23:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:27,482 INFO L225 Difference]: With dead ends: 115 [2019-11-22 10:23:27,482 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 10:23:27,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:23:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 10:23:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-22 10:23:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-22 10:23:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-22 10:23:27,490 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-22 10:23:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:27,490 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-22 10:23:27,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 10:23:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-22 10:23:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 10:23:27,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:27,492 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-22 10:23:27,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:27,695 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:27,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1662752269, now seen corresponding path program 1 times [2019-11-22 10:23:27,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:27,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1886997499] [2019-11-22 10:23:27,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:27,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 10:23:27,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:27,891 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-22 10:23:27,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:27,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:27,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:27,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:23:27,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 10:23:27,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:27,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:27,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 10:23:27,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:27,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:27,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:27,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-22 10:23:28,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-22 10:23:28,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:28,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:28,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-22 10:23:28,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:28,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:28,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:28,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-22 10:23:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:28,050 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:28,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1886997499] [2019-11-22 10:23:28,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:28,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:23:28,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690913060] [2019-11-22 10:23:28,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:23:28,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:28,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:23:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 10:23:28,255 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-22 10:23:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:29,408 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-22 10:23:29,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 10:23:29,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 10:23:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:29,411 INFO L225 Difference]: With dead ends: 125 [2019-11-22 10:23:29,411 INFO L226 Difference]: Without dead ends: 125 [2019-11-22 10:23:29,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-22 10:23:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-22 10:23:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-22 10:23:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-22 10:23:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-22 10:23:29,417 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-22 10:23:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:29,418 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-22 10:23:29,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:23:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-22 10:23:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 10:23:29,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:29,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:29,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:29,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1657775174, now seen corresponding path program 1 times [2019-11-22 10:23:29,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:29,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [703601351] [2019-11-22 10:23:29,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:29,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 10:23:29,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:29,843 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-22 10:23:29,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:29,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:29,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:29,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 10:23:29,897 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-22 10:23:29,897 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:34,098 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-22 10:23:34,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [703601351] [2019-11-22 10:23:34,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:34,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 10:23:34,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801181534] [2019-11-22 10:23:34,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 10:23:34,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:34,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 10:23:34,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2019-11-22 10:23:34,100 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-22 10:23:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:34,639 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-22 10:23:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 10:23:34,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-22 10:23:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:34,641 INFO L225 Difference]: With dead ends: 111 [2019-11-22 10:23:34,641 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 10:23:34,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=44, Invalid=110, Unknown=2, NotChecked=0, Total=156 [2019-11-22 10:23:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 10:23:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-22 10:23:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-22 10:23:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-22 10:23:34,650 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-22 10:23:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:34,650 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-22 10:23:34,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 10:23:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-22 10:23:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 10:23:34,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:34,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:34,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:34,854 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1659192231, now seen corresponding path program 1 times [2019-11-22 10:23:34,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:34,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1459685595] [2019-11-22 10:23:34,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:35,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 10:23:35,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:35,048 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-22 10:23:35,048 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:35,055 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-22 10:23:35,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1459685595] [2019-11-22 10:23:35,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:35,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 10:23:35,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023222283] [2019-11-22 10:23:35,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 10:23:35,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 10:23:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 10:23:35,057 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 5 states. [2019-11-22 10:23:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:35,366 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-11-22 10:23:35,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 10:23:35,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-22 10:23:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:35,368 INFO L225 Difference]: With dead ends: 106 [2019-11-22 10:23:35,368 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 10:23:35,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-22 10:23:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 10:23:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-22 10:23:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-22 10:23:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-11-22 10:23:35,375 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 20 [2019-11-22 10:23:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:35,375 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-11-22 10:23:35,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 10:23:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-11-22 10:23:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 10:23:35,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:35,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:35,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:35,582 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -104648209, now seen corresponding path program 1 times [2019-11-22 10:23:35,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:35,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1130175872] [2019-11-22 10:23:35,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:35,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 10:23:35,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:35,792 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-22 10:23:35,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:35,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:35,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:35,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-22 10:23:35,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-22 10:23:35,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:35,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:35,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:35,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-22 10:23:35,902 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-22 10:23:35,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:35,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:35,994 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2019-11-22 10:23:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:23:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:23:36,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:36,086 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-22 10:23:36,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-22 10:23:36,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-22 10:23:36,109 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-22 10:23:36,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1130175872] [2019-11-22 10:23:36,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:36,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-22 10:23:36,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103889477] [2019-11-22 10:23:36,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 10:23:36,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 10:23:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-22 10:23:36,111 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 13 states. [2019-11-22 10:23:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:36,774 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2019-11-22 10:23:36,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 10:23:36,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-22 10:23:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:36,777 INFO L225 Difference]: With dead ends: 113 [2019-11-22 10:23:36,777 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 10:23:36,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-11-22 10:23:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 10:23:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-11-22 10:23:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 10:23:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-22 10:23:36,781 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 21 [2019-11-22 10:23:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:36,782 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-22 10:23:36,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 10:23:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-22 10:23:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-22 10:23:36,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:36,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:36,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:36,986 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash 773245120, now seen corresponding path program 1 times [2019-11-22 10:23:36,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:36,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [84120106] [2019-11-22 10:23:36,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:37,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 10:23:37,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:37,245 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-22 10:23:37,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:23:37,315 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-22 10:23:37,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-22 10:23:37,366 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,367 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-22 10:23:37,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-22 10:23:37,406 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|], 2=[|v_#memory_int_26|]} [2019-11-22 10:23:37,418 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-22 10:23:37,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:23:37,456 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 29 treesize of output 13 [2019-11-22 10:23:37,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-22 10:23:37,519 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-22 10:23:37,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-22 10:23:37,612 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 21 treesize of output 20 [2019-11-22 10:23:37,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:37,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-22 10:23:37,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-22 10:23:37,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:37,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:37,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-22 10:23:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:37,792 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:38,056 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:38,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:38,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:38,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-22 10:23:40,308 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 274 treesize of output 266 [2019-11-22 10:23:40,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 10:23:40,543 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2019-11-22 10:23:40,543 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-22 10:23:40,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:40,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-22 10:23:40,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-22 10:23:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:40,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [84120106] [2019-11-22 10:23:40,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:23:40,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 10:23:40,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546945824] [2019-11-22 10:23:40,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 10:23:40,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 10:23:40,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-22 10:23:40,767 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 22 states. [2019-11-22 10:23:42,295 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-11-22 10:23:42,495 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-22 10:23:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:43,507 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-11-22 10:23:43,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 10:23:43,508 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-22 10:23:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:43,509 INFO L225 Difference]: With dead ends: 100 [2019-11-22 10:23:43,509 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 10:23:43,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=259, Invalid=1000, Unknown=1, NotChecked=0, Total=1260 [2019-11-22 10:23:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 10:23:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2019-11-22 10:23:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-22 10:23:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2019-11-22 10:23:43,514 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 29 [2019-11-22 10:23:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:43,514 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2019-11-22 10:23:43,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 10:23:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2019-11-22 10:23:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 10:23:43,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:43,516 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:43,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:43,726 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:43,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1399266987, now seen corresponding path program 1 times [2019-11-22 10:23:43,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:43,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [889602125] [2019-11-22 10:23:43,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:43,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 10:23:43,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 10:23:43,912 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 10:23:43,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [889602125] [2019-11-22 10:23:43,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 10:23:43,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 10:23:43,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470355748] [2019-11-22 10:23:43,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 10:23:43,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:23:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 10:23:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 10:23:43,919 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2019-11-22 10:23:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:23:43,938 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2019-11-22 10:23:43,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 10:23:43,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-22 10:23:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:23:43,939 INFO L225 Difference]: With dead ends: 124 [2019-11-22 10:23:43,939 INFO L226 Difference]: Without dead ends: 124 [2019-11-22 10:23:43,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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-22 10:23:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-22 10:23:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2019-11-22 10:23:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-22 10:23:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2019-11-22 10:23:43,943 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2019-11-22 10:23:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:23:43,943 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2019-11-22 10:23:43,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 10:23:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2019-11-22 10:23:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 10:23:43,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 10:23:43,945 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 10:23:44,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:44,148 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 10:23:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 10:23:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash -33706853, now seen corresponding path program 1 times [2019-11-22 10:23:44,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 10:23:44,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [509609870] [2019-11-22 10:23:44,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:23:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 10:23:44,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-22 10:23:44,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 10:23:44,463 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-22 10:23:44,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 10:23:44,495 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-22 10:23:44,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-22 10:23:44,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,549 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-22 10:23:44,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-22 10:23:44,597 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_36|]} [2019-11-22 10:23:44,606 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-22 10:23:44,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:23:44,655 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 29 treesize of output 13 [2019-11-22 10:23:44,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:34 [2019-11-22 10:23:44,718 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-22 10:23:44,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-22 10:23:44,786 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 21 treesize of output 20 [2019-11-22 10:23:44,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-22 10:23:44,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 10:23:44,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-22 10:23:44,894 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_33|], 6=[|v_#memory_int_38|]} [2019-11-22 10:23:44,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-22 10:23:44,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 10:23:44,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-11-22 10:23:44,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:44,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:44,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:36 [2019-11-22 10:23:45,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 10:23:45,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:45,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:45,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:45,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2019-11-22 10:23:45,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:45,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-22 10:23:45,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:45,223 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-22 10:23:45,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:45,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:45,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:43 [2019-11-22 10:23:45,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:45,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:23:45,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-22 10:23:45,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:23:45,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:45,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 10:23:45,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2019-11-22 10:23:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:23:45,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 10:23:45,555 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:45,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:23:45,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:23:45,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-22 10:23:47,666 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-22 10:23:53,764 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-22 10:23:57,887 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-22 10:23:59,994 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-22 10:24:00,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:24:00,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-22 10:24:00,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 10:24:00,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:24:00,050 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 10:24:00,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 10:24:00,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 10:24:00,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:41 [2019-11-22 10:24:06,435 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 754 treesize of output 746 [2019-11-22 10:24:06,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 10:24:06,977 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-11-22 10:24:06,977 INFO L567 ElimStorePlain]: treesize reduction 659, result has 10.6 percent of original size [2019-11-22 10:24:06,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 10:24:06,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:24:06,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 10:24:06,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-22 10:24:06,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:59 [2019-11-22 10:24:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 10:24:07,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [509609870] [2019-11-22 10:24:07,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 10:24:07,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-22 10:24:07,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687749536] [2019-11-22 10:24:07,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-22 10:24:07,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 10:24:07,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-22 10:24:07,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=673, Unknown=6, NotChecked=0, Total=812 [2019-11-22 10:24:07,261 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 29 states. [2019-11-22 10:24:11,624 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-22 10:24:15,901 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-22 10:24:34,115 WARN L192 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-11-22 10:24:48,402 WARN L192 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-22 10:25:15,016 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-11-22 10:25:23,210 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-11-22 10:25:31,894 WARN L192 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-22 10:25:48,221 WARN L192 SmtUtils]: Spent 12.22 s on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-11-22 10:26:08,591 WARN L192 SmtUtils]: Spent 8.13 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-11-22 10:26:21,133 WARN L192 SmtUtils]: Spent 10.29 s on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-22 10:26:35,840 WARN L192 SmtUtils]: Spent 12.53 s on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-22 10:26:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 10:26:39,855 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-11-22 10:26:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-22 10:26:39,859 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-22 10:26:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 10:26:39,859 INFO L225 Difference]: With dead ends: 67 [2019-11-22 10:26:39,859 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 10:26:39,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 121.8s TimeCoverageRelationStatistics Valid=567, Invalid=2280, Unknown=15, NotChecked=0, Total=2862 [2019-11-22 10:26:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 10:26:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 10:26:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 10:26:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 10:26:39,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-22 10:26:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 10:26:39,862 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 10:26:39,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-22 10:26:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 10:26:39,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 10:26:40,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 10:26:40,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:26:40 BoogieIcfgContainer [2019-11-22 10:26:40,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 10:26:40,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 10:26:40,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 10:26:40,070 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 10:26:40,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:20" (3/4) ... [2019-11-22 10:26:40,075 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 10:26:40,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 10:26:40,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 10:26:40,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 10:26:40,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 10:26:40,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 10:26:40,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 10:26:40,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 10:26:40,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 10:26:40,083 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 10:26:40,091 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-22 10:26:40,092 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 10:26:40,092 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 10:26:40,092 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 10:26:40,152 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 10:26:40,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 10:26:40,153 INFO L168 Benchmark]: Toolchain (without parser) took 201252.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -214.8 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2019-11-22 10:26:40,153 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:26:40,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-22 10:26:40,155 INFO L168 Benchmark]: Boogie Preprocessor took 94.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-22 10:26:40,156 INFO L168 Benchmark]: RCFGBuilder took 937.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-22 10:26:40,156 INFO L168 Benchmark]: TraceAbstraction took 199494.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-11-22 10:26:40,156 INFO L168 Benchmark]: Witness Printer took 82.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 10:26:40,158 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 937.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 199494.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * Witness Printer took 82.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: 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: 560]: free always succeeds For all program executions holds that free 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: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: 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 - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: 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: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 101 locations, 29 error locations. Result: SAFE, OverallTime: 199.4s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 161.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 638 SDtfs, 1872 SDslu, 2066 SDs, 0 SdLazy, 2320 SolverSat, 366 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 57.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 468 SyntacticMatches, 7 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 132.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 278 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 32.2s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 566 ConstructedInterpolants, 41 QuantifiedInterpolants, 98144 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1157 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 28 InterpolantComputations, 24 PerfectInterpolantSequences, 34/54 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...