./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab 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/list-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 283704c20cde057c38dc133107a27c4d033fb1ba ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 283704c20cde057c38dc133107a27c4d033fb1ba .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:42:21,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:42:21,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:42:21,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:42:21,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:42:21,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:42:21,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:42:21,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:42:21,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:42:21,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:42:21,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:42:21,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:42:21,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:42:21,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:42:21,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:42:21,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:42:21,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:42:21,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:42:21,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:42:21,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:42:21,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:42:21,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:42:21,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:42:21,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:42:21,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:42:21,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:42:21,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:42:21,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:42:21,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:42:21,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:42:21,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:42:21,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:42:21,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:42:21,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:42:21,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:42:21,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:42:21,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:42:21,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:42:21,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:42:21,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:42:21,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:42:21,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:42:21,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:42:21,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:42:21,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:42:21,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:42:21,184 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:42:21,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:42:21,185 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:42:21,185 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:42:21,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:42:21,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:42:21,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:42:21,186 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:42:21,186 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:42:21,187 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:42:21,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:42:21,187 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:42:21,188 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:42:21,188 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:42:21,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:42:21,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:42:21,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:42:21,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:42:21,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:42:21,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:42:21,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:42:21,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:42:21,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:42:21,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 283704c20cde057c38dc133107a27c4d033fb1ba [2019-11-28 02:42:21,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:42:21,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:42:21,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:42:21,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:42:21,552 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:42:21,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2019-11-28 02:42:21,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078224ee9/ea5fad6d5fa94fc4a5bfb50e0381f461/FLAGae052408e [2019-11-28 02:42:22,120 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:42:22,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2019-11-28 02:42:22,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078224ee9/ea5fad6d5fa94fc4a5bfb50e0381f461/FLAGae052408e [2019-11-28 02:42:22,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078224ee9/ea5fad6d5fa94fc4a5bfb50e0381f461 [2019-11-28 02:42:22,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:42:22,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:42:22,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:42:22,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:42:22,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:42:22,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:42:22" (1/1) ... [2019-11-28 02:42:22,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cfe08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:22, skipping insertion in model container [2019-11-28 02:42:22,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:42:22" (1/1) ... [2019-11-28 02:42:22,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:42:22,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:42:23,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:42:23,020 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:42:23,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:42:23,129 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:42:23,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23 WrapperNode [2019-11-28 02:42:23,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:42:23,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:42:23,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:42:23,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:42:23,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... [2019-11-28 02:42:23,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... [2019-11-28 02:42:23,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... [2019-11-28 02:42:23,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... [2019-11-28 02:42:23,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... [2019-11-28 02:42:23,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... [2019-11-28 02:42:23,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... [2019-11-28 02:42:23,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:42:23,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:42:23,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:42:23,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:42:23,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:42:23,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:42:23,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:42:23,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:42:23,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:42:23,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 02:42:23,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 02:42:23,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 02:42:23,260 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 02:42:23,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:42:23,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:42:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:42:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:42:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:42:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:42:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:42:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:42:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:42:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:42:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:42:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:42:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:42:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:42:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:42:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:42:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:42:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:42:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:42:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:42:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:42:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 02:42:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 02:42:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 02:42:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:42:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:42:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:42:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:42:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:42:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:42:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:42:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:42:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:42:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:42:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:42:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:42:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:42:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:42:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:42:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:42:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:42:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:42:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:42:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:42:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:42:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:42:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:42:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:42:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:42:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:42:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:42:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:42:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:42:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:42:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:42:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:42:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:42:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:42:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:42:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:42:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:42:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:42:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:42:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:42:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:42:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:42:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:42:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:42:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:42:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:42:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:42:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:42:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:42:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:42:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:42:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:42:23,277 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:42:23,277 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:42:23,277 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:42:23,277 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:42:23,277 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:42:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:42:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:42:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:42:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:42:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:42:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:42:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:42:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:42:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:42:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:42:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:42:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:42:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:42:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:42:23,280 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:42:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:42:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:42:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:42:23,281 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:42:23,282 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:42:23,282 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:42:23,282 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:42:23,282 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:42:23,282 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:42:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:42:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:42:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:42:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:42:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:42:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 02:42:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:42:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:42:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:42:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:42:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:42:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:42:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:42:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:42:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:42:23,611 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 02:42:23,879 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:42:23,879 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:42:23,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:23 BoogieIcfgContainer [2019-11-28 02:42:23,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:42:23,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:42:23,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:42:23,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:42:23,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:42:22" (1/3) ... [2019-11-28 02:42:23,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2cec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:42:23, skipping insertion in model container [2019-11-28 02:42:23,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:23" (2/3) ... [2019-11-28 02:42:23,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2cec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:42:23, skipping insertion in model container [2019-11-28 02:42:23,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:23" (3/3) ... [2019-11-28 02:42:23,891 INFO L109 eAbstractionObserver]: Analyzing ICFG list-1.i [2019-11-28 02:42:23,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:42:23,912 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2019-11-28 02:42:23,926 INFO L249 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2019-11-28 02:42:23,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:42:23,950 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:42:23,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:42:23,951 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:42:23,951 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:42:23,951 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:42:23,952 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:42:23,952 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:42:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-28 02:42:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:42:23,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:23,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:23,989 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:23,995 INFO L82 PathProgramCache]: Analyzing trace with hash -516857152, now seen corresponding path program 1 times [2019-11-28 02:42:24,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:24,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917752385] [2019-11-28 02:42:24,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:24,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917752385] [2019-11-28 02:42:24,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:24,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:42:24,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121426964] [2019-11-28 02:42:24,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:42:24,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:42:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:42:24,219 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-28 02:42:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:24,440 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-11-28 02:42:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:42:24,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 02:42:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:24,455 INFO L225 Difference]: With dead ends: 73 [2019-11-28 02:42:24,455 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 02:42:24,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:42:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 02:42:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 02:42:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:42:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-11-28 02:42:24,525 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 11 [2019-11-28 02:42:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:24,526 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-11-28 02:42:24,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:42:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-11-28 02:42:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:42:24,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:24,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:24,529 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash -516882778, now seen corresponding path program 1 times [2019-11-28 02:42:24,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:24,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101582590] [2019-11-28 02:42:24,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:24,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101582590] [2019-11-28 02:42:24,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:24,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:42:24,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254452932] [2019-11-28 02:42:24,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:42:24,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:42:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:42:24,676 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 5 states. [2019-11-28 02:42:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:24,892 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-28 02:42:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:42:24,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 02:42:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:24,896 INFO L225 Difference]: With dead ends: 72 [2019-11-28 02:42:24,896 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 02:42:24,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:42:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 02:42:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2019-11-28 02:42:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 02:42:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-11-28 02:42:24,918 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 11 [2019-11-28 02:42:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:24,919 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-11-28 02:42:24,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:42:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-11-28 02:42:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:42:24,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:24,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:24,923 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash -516882777, now seen corresponding path program 1 times [2019-11-28 02:42:24,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:24,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569037585] [2019-11-28 02:42:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:25,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569037585] [2019-11-28 02:42:25,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:25,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:42:25,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673314296] [2019-11-28 02:42:25,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:42:25,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:25,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:42:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:42:25,052 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 5 states. [2019-11-28 02:42:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:25,304 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-11-28 02:42:25,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:42:25,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 02:42:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:25,307 INFO L225 Difference]: With dead ends: 92 [2019-11-28 02:42:25,307 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 02:42:25,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:42:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 02:42:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2019-11-28 02:42:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 02:42:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-11-28 02:42:25,317 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 11 [2019-11-28 02:42:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:25,318 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-11-28 02:42:25,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:42:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-11-28 02:42:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:42:25,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:25,320 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-28 02:42:25,320 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:25,321 INFO L82 PathProgramCache]: Analyzing trace with hash -725497357, now seen corresponding path program 1 times [2019-11-28 02:42:25,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:25,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643284826] [2019-11-28 02:42:25,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:25,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643284826] [2019-11-28 02:42:25,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:25,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:42:25,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300262594] [2019-11-28 02:42:25,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:42:25,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:42:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:42:25,440 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 7 states. [2019-11-28 02:42:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:25,737 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-28 02:42:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:42:25,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:42:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:25,739 INFO L225 Difference]: With dead ends: 120 [2019-11-28 02:42:25,740 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 02:42:25,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:42:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 02:42:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2019-11-28 02:42:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 02:42:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2019-11-28 02:42:25,760 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 19 [2019-11-28 02:42:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:25,761 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2019-11-28 02:42:25,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:42:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2019-11-28 02:42:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:42:25,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:25,763 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:25,764 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:25,764 INFO L82 PathProgramCache]: Analyzing trace with hash 538341657, now seen corresponding path program 1 times [2019-11-28 02:42:25,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:25,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066572255] [2019-11-28 02:42:25,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:25,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066572255] [2019-11-28 02:42:25,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:25,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:42:25,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751818702] [2019-11-28 02:42:25,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:42:25,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:25,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:42:25,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:42:25,942 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 7 states. [2019-11-28 02:42:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:26,337 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-28 02:42:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:42:26,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:42:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:26,339 INFO L225 Difference]: With dead ends: 109 [2019-11-28 02:42:26,339 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 02:42:26,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:42:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 02:42:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2019-11-28 02:42:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 02:42:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-28 02:42:26,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 19 [2019-11-28 02:42:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:26,347 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-28 02:42:26,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:42:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-28 02:42:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:42:26,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:26,348 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:26,349 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash 538341658, now seen corresponding path program 1 times [2019-11-28 02:42:26,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:26,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190219497] [2019-11-28 02:42:26,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:26,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190219497] [2019-11-28 02:42:26,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:26,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:42:26,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075330477] [2019-11-28 02:42:26,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:42:26,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:26,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:42:26,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:42:26,473 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 7 states. [2019-11-28 02:42:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:27,036 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2019-11-28 02:42:27,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:42:27,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:42:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:27,038 INFO L225 Difference]: With dead ends: 110 [2019-11-28 02:42:27,038 INFO L226 Difference]: Without dead ends: 110 [2019-11-28 02:42:27,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:42:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-28 02:42:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2019-11-28 02:42:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:42:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-11-28 02:42:27,046 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 19 [2019-11-28 02:42:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:27,047 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-11-28 02:42:27,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:42:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-11-28 02:42:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:42:27,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:27,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:27,049 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:27,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:27,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1465888843, now seen corresponding path program 1 times [2019-11-28 02:42:27,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:27,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809501775] [2019-11-28 02:42:27,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:27,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809501775] [2019-11-28 02:42:27,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:27,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:42:27,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166434999] [2019-11-28 02:42:27,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:42:27,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:27,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:42:27,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:42:27,139 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 7 states. [2019-11-28 02:42:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:27,416 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2019-11-28 02:42:27,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:42:27,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:42:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:27,418 INFO L225 Difference]: With dead ends: 122 [2019-11-28 02:42:27,418 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 02:42:27,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:42:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 02:42:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2019-11-28 02:42:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 02:42:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-11-28 02:42:27,427 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 21 [2019-11-28 02:42:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:27,428 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-11-28 02:42:27,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:42:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-11-28 02:42:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:42:27,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:27,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:27,429 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1465836288, now seen corresponding path program 1 times [2019-11-28 02:42:27,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:27,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264680006] [2019-11-28 02:42:27,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:27,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264680006] [2019-11-28 02:42:27,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:27,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:42:27,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246489898] [2019-11-28 02:42:27,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:42:27,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:42:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:42:27,513 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 7 states. [2019-11-28 02:42:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:27,777 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2019-11-28 02:42:27,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:42:27,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:42:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:27,778 INFO L225 Difference]: With dead ends: 105 [2019-11-28 02:42:27,779 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 02:42:27,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:42:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 02:42:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2019-11-28 02:42:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 02:42:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-11-28 02:42:27,785 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 21 [2019-11-28 02:42:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:27,785 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-11-28 02:42:27,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:42:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-11-28 02:42:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:42:27,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:27,786 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:27,787 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1761650517, now seen corresponding path program 1 times [2019-11-28 02:42:27,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:27,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512730949] [2019-11-28 02:42:27,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:27,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512730949] [2019-11-28 02:42:27,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:27,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:42:27,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519007505] [2019-11-28 02:42:27,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:42:27,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:42:27,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:42:27,849 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 7 states. [2019-11-28 02:42:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:28,158 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-11-28 02:42:28,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:42:28,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:42:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:28,160 INFO L225 Difference]: With dead ends: 88 [2019-11-28 02:42:28,160 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 02:42:28,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:42:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 02:42:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2019-11-28 02:42:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 02:42:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-11-28 02:42:28,166 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 21 [2019-11-28 02:42:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:28,166 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-11-28 02:42:28,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:42:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-11-28 02:42:28,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:42:28,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:28,168 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:28,168 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1761650516, now seen corresponding path program 1 times [2019-11-28 02:42:28,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:28,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835251912] [2019-11-28 02:42:28,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:28,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835251912] [2019-11-28 02:42:28,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:28,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:42:28,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203398224] [2019-11-28 02:42:28,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:42:28,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:42:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:42:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:42:28,289 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 7 states. [2019-11-28 02:42:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:28,688 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-28 02:42:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:42:28,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:42:28,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:28,689 INFO L225 Difference]: With dead ends: 85 [2019-11-28 02:42:28,689 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 02:42:28,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:42:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 02:42:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-11-28 02:42:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:42:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-11-28 02:42:28,693 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 21 [2019-11-28 02:42:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:28,694 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-11-28 02:42:28,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:42:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-11-28 02:42:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:42:28,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:28,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:28,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:28,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1802091221, now seen corresponding path program 1 times [2019-11-28 02:42:28,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:42:28,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987598615] [2019-11-28 02:42:28,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:42:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:42:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:42:28,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:42:28,764 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:42:28,779 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 02:42:28,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:42:28 BoogieIcfgContainer [2019-11-28 02:42:28,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:42:28,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:42:28,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:42:28,793 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:42:28,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:23" (3/4) ... [2019-11-28 02:42:28,797 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:42:28,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:42:28,800 INFO L168 Benchmark]: Toolchain (without parser) took 6355.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 957.7 MB in the beginning and 990.5 MB in the end (delta: -32.8 MB). Peak memory consumption was 173.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:28,800 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:42:28,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:28,802 INFO L168 Benchmark]: Boogie Preprocessor took 62.98 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:28,803 INFO L168 Benchmark]: RCFGBuilder took 686.91 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:28,804 INFO L168 Benchmark]: TraceAbstraction took 4909.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 990.5 MB in the end (delta: 62.9 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:28,804 INFO L168 Benchmark]: Witness Printer took 4.50 ms. Allocated memory is still 1.2 GB. Free memory is still 990.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:42:28,808 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.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.98 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 686.91 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4909.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 990.5 MB in the end (delta: 62.9 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.50 ms. Allocated memory is still 1.2 GB. Free memory is still 990.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L540] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L541] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L541] COND FALSE !(p->h == 1) [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L543] COND FALSE !(p->h == 2) [L545] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L545] COND FALSE !(p->h != 3) [L547] return 0; VAL [\result=0, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 89 locations, 26 error locations. Result: UNSAFE, OverallTime: 4.8s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 463 SDtfs, 689 SDslu, 939 SDs, 0 SdLazy, 1838 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 194 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 12096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:42:30,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:42:30,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:42:30,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:42:30,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:42:30,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:42:30,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:42:30,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:42:30,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:42:30,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:42:30,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:42:30,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:42:30,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:42:30,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:42:30,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:42:30,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:42:30,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:42:30,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:42:30,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:42:30,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:42:30,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:42:30,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:42:30,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:42:30,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:42:30,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:42:30,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:42:30,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:42:30,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:42:30,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:42:30,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:42:30,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:42:30,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:42:30,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:42:30,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:42:30,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:42:30,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:42:30,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:42:30,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:42:30,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:42:30,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:42:30,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:42:30,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 02:42:30,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:42:30,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:42:30,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:42:30,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:42:30,907 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:42:30,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:42:30,907 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:42:30,908 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:42:30,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:42:30,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:42:30,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:42:30,909 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:42:30,909 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:42:30,909 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:42:30,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:42:30,910 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:42:30,910 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 02:42:30,910 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 02:42:30,911 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:42:30,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:42:30,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:42:30,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:42:30,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:42:30,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:42:30,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:42:30,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:42:30,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:42:30,914 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 02:42:30,914 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 02:42:30,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 02:42:30,914 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 283704c20cde057c38dc133107a27c4d033fb1ba [2019-11-28 02:42:31,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:42:31,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:42:31,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:42:31,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:42:31,240 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:42:31,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2019-11-28 02:42:31,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d45138b2/46605bde35044d478a92404d7cea1408/FLAG5146b6b0e [2019-11-28 02:42:31,820 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:42:31,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2019-11-28 02:42:31,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d45138b2/46605bde35044d478a92404d7cea1408/FLAG5146b6b0e [2019-11-28 02:42:32,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d45138b2/46605bde35044d478a92404d7cea1408 [2019-11-28 02:42:32,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:42:32,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:42:32,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:42:32,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:42:32,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:42:32,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b54b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32, skipping insertion in model container [2019-11-28 02:42:32,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:42:32,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:42:32,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:42:32,676 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:42:32,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:42:32,835 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:42:32,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32 WrapperNode [2019-11-28 02:42:32,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:42:32,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:42:32,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:42:32,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:42:32,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... [2019-11-28 02:42:32,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:42:32,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:42:32,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:42:32,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:42:32,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:42:32,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:42:32,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:42:32,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 02:42:32,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:42:32,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:42:32,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 02:42:32,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 02:42:32,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 02:42:32,992 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 02:42:32,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:42:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:42:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:42:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:42:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:42:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:42:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:42:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:42:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:42:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:42:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:42:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:42:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:42:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:42:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:42:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:42:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:42:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:42:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:42:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:42:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:42:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 02:42:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 02:42:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 02:42:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:42:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:42:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:42:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:42:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:42:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:42:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:42:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:42:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:42:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:42:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:42:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:42:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:42:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:42:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:42:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:42:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:42:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:42:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:42:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:42:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:42:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:42:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:42:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:42:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:42:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:42:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:42:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:42:33,004 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:42:33,004 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:42:33,004 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:42:33,004 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:42:33,004 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:42:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:42:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:42:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:42:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:42:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:42:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:42:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:42:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:42:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:42:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:42:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:42:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:42:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:42:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:42:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:42:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:42:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:42:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:42:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:42:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:42:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:42:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:42:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:42:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:42:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:42:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:42:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:42:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:42:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:42:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:42:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:42:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:42:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:42:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:42:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:42:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:42:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:42:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:42:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:42:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:42:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:42:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:42:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:42:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:42:33,014 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:42:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:42:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:42:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:42:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 02:42:33,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:42:33,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:42:33,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 02:42:33,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:42:33,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:42:33,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 02:42:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:42:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:42:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 02:42:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:42:33,391 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 02:42:33,716 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:42:33,717 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:42:33,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:33 BoogieIcfgContainer [2019-11-28 02:42:33,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:42:33,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:42:33,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:42:33,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:42:33,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:42:32" (1/3) ... [2019-11-28 02:42:33,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcc67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:42:33, skipping insertion in model container [2019-11-28 02:42:33,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:32" (2/3) ... [2019-11-28 02:42:33,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcc67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:42:33, skipping insertion in model container [2019-11-28 02:42:33,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:33" (3/3) ... [2019-11-28 02:42:33,729 INFO L109 eAbstractionObserver]: Analyzing ICFG list-1.i [2019-11-28 02:42:33,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:42:33,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2019-11-28 02:42:33,767 INFO L249 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2019-11-28 02:42:33,793 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:42:33,793 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:42:33,794 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:42:33,794 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:42:33,794 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:42:33,794 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:42:33,794 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:42:33,795 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:42:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-28 02:42:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:42:33,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:33,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:33,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:33,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1988574950, now seen corresponding path program 1 times [2019-11-28 02:42:33,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:33,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279759488] [2019-11-28 02:42:33,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:33,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:42:34,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:34,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:42:34,091 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:34,103 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:34,104 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:34,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 02:42:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:34,126 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:34,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279759488] [2019-11-28 02:42:34,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:34,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 02:42:34,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25633268] [2019-11-28 02:42:34,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:42:34,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:42:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:42:34,177 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2019-11-28 02:42:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:34,528 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-11-28 02:42:34,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:42:34,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:42:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:34,546 INFO L225 Difference]: With dead ends: 76 [2019-11-28 02:42:34,546 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 02:42:34,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:42:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 02:42:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-28 02:42:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 02:42:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-11-28 02:42:34,633 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 10 [2019-11-28 02:42:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:34,636 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-11-28 02:42:34,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:42:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-11-28 02:42:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:42:34,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:34,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:34,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 02:42:34,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1988574949, now seen corresponding path program 1 times [2019-11-28 02:42:34,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:34,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365249167] [2019-11-28 02:42:34,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:34,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:42:34,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:34,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:42:34,994 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:35,006 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:35,007 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:35,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 02:42:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:35,038 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:35,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365249167] [2019-11-28 02:42:35,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:35,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-28 02:42:35,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961671635] [2019-11-28 02:42:35,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:42:35,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:42:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:42:35,152 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 6 states. [2019-11-28 02:42:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:35,621 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-11-28 02:42:35,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:42:35,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-28 02:42:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:35,627 INFO L225 Difference]: With dead ends: 87 [2019-11-28 02:42:35,627 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 02:42:35,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:42:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 02:42:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-28 02:42:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 02:42:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-28 02:42:35,638 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2019-11-28 02:42:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:35,638 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-28 02:42:35,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:42:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-28 02:42:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:42:35,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:35,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:35,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 02:42:35,847 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:35,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1350148850, now seen corresponding path program 1 times [2019-11-28 02:42:35,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:35,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33709174] [2019-11-28 02:42:35,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:35,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:42:35,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:35,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:42:35,991 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:35,995 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:35,996 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:35,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 02:42:36,026 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-28 02:42:36,027 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:36,031 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:36,031 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:36,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-28 02:42:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:36,055 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:36,120 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-28 02:42:36,121 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 02:42:36,134 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:36,135 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:42:36,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-28 02:42:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:36,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33709174] [2019-11-28 02:42:36,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:36,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-28 02:42:36,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562512733] [2019-11-28 02:42:36,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:42:36,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:36,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:42:36,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:42:36,152 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 9 states. [2019-11-28 02:42:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:36,897 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2019-11-28 02:42:36,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:42:36,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:42:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:36,900 INFO L225 Difference]: With dead ends: 153 [2019-11-28 02:42:36,901 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 02:42:36,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:42:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 02:42:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 81. [2019-11-28 02:42:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 02:42:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-11-28 02:42:36,913 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2019-11-28 02:42:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:36,913 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-11-28 02:42:36,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:42:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-11-28 02:42:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:42:36,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:36,915 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:37,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 02:42:37,136 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1193824230, now seen corresponding path program 1 times [2019-11-28 02:42:37,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:37,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790536183] [2019-11-28 02:42:37,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:37,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:42:37,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:37,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:42:37,253 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:37,257 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:37,257 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:37,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 02:42:37,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:42:37,297 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:37,304 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:37,305 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:37,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-28 02:42:37,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-28 02:42:37,327 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:37,329 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:37,329 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:37,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-11-28 02:42:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:37,343 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:37,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790536183] [2019-11-28 02:42:37,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:37,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 02:42:37,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047092240] [2019-11-28 02:42:37,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:42:37,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:42:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:42:37,364 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 6 states. [2019-11-28 02:42:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:37,851 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-11-28 02:42:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:42:37,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-28 02:42:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:37,854 INFO L225 Difference]: With dead ends: 105 [2019-11-28 02:42:37,854 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 02:42:37,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:42:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 02:42:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2019-11-28 02:42:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:42:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-11-28 02:42:37,863 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 17 [2019-11-28 02:42:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:37,864 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-11-28 02:42:37,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:42:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-11-28 02:42:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:42:37,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:37,865 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:38,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 02:42:38,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:38,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1193824231, now seen corresponding path program 1 times [2019-11-28 02:42:38,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:38,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431292897] [2019-11-28 02:42:38,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:38,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:42:38,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:38,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:42:38,170 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,175 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:38,176 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 02:42:38,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:42:38,206 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,220 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:38,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:42:38,229 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,242 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:38,243 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-28 02:42:38,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-28 02:42:38,287 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,303 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:38,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 19 treesize of output 7 [2019-11-28 02:42:38,308 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,314 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:38,315 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:38,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-28 02:42:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:38,359 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:38,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431292897] [2019-11-28 02:42:38,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:38,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 02:42:38,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312184366] [2019-11-28 02:42:38,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:42:38,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:38,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:42:38,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:42:38,609 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 10 states. [2019-11-28 02:42:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:39,962 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2019-11-28 02:42:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:42:39,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-28 02:42:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:39,965 INFO L225 Difference]: With dead ends: 107 [2019-11-28 02:42:39,965 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 02:42:39,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 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-28 02:42:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 02:42:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 79. [2019-11-28 02:42:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 02:42:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2019-11-28 02:42:39,973 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 17 [2019-11-28 02:42:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:39,973 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-11-28 02:42:39,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:42:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2019-11-28 02:42:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:42:39,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:39,974 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:40,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 02:42:40,193 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:40,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1776718273, now seen corresponding path program 1 times [2019-11-28 02:42:40,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:40,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269757808] [2019-11-28 02:42:40,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:40,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:42:40,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:40,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:42:40,310 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:40,314 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:40,314 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:40,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 02:42:40,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:42:40,325 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:40,332 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:40,333 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:40,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-28 02:42:40,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-28 02:42:40,346 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:40,348 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:40,348 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:40,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-28 02:42:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:40,366 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:40,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269757808] [2019-11-28 02:42:40,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:40,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 02:42:40,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045038766] [2019-11-28 02:42:40,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:42:40,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:40,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:42:40,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:42:40,379 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 6 states. [2019-11-28 02:42:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:40,756 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-11-28 02:42:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:42:40,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-28 02:42:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:40,757 INFO L225 Difference]: With dead ends: 99 [2019-11-28 02:42:40,758 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 02:42:40,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:42:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 02:42:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2019-11-28 02:42:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 02:42:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-11-28 02:42:40,765 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 18 [2019-11-28 02:42:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:40,766 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-11-28 02:42:40,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:42:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-11-28 02:42:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:42:40,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:40,767 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:40,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 02:42:40,971 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1776718274, now seen corresponding path program 1 times [2019-11-28 02:42:40,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:40,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763578541] [2019-11-28 02:42:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:41,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:42:41,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:41,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:42:41,081 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,088 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:41,088 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 02:42:41,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:42:41,112 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,129 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:41,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:42:41,137 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,153 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:41,154 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-28 02:42:41,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-28 02:42:41,196 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,212 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:41,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-28 02:42:41,217 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,224 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:41,225 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:41,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:9 [2019-11-28 02:42:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:41,257 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:41,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763578541] [2019-11-28 02:42:41,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:41,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 02:42:41,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808236473] [2019-11-28 02:42:41,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:42:41,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:42:41,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:42:41,461 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 10 states. [2019-11-28 02:42:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:42,487 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2019-11-28 02:42:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:42:42,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-28 02:42:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:42,488 INFO L225 Difference]: With dead ends: 97 [2019-11-28 02:42:42,489 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 02:42:42,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 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-28 02:42:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 02:42:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2019-11-28 02:42:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:42:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-11-28 02:42:42,497 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 18 [2019-11-28 02:42:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:42,497 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-11-28 02:42:42,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:42:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-11-28 02:42:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:42:42,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:42,498 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-28 02:42:42,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 02:42:42,700 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash -460551536, now seen corresponding path program 1 times [2019-11-28 02:42:42,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:42,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941849640] [2019-11-28 02:42:42,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:42,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:42:42,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:42,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:42:42,844 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:42,848 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:42,848 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:42,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 02:42:42,886 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-28 02:42:42,887 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:42,892 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:42,893 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:42,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2019-11-28 02:42:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:42,910 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:42,922 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 25 treesize of output 21 [2019-11-28 02:42:42,923 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 02:42:42,930 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:42,930 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:42:42,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:7 [2019-11-28 02:42:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:42,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941849640] [2019-11-28 02:42:42,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:42,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-28 02:42:42,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100075338] [2019-11-28 02:42:42,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:42:42,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:42,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:42:42,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:42:42,945 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 6 states. [2019-11-28 02:42:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:43,277 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-28 02:42:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:42:43,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-28 02:42:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:43,279 INFO L225 Difference]: With dead ends: 107 [2019-11-28 02:42:43,279 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 02:42:43,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:42:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 02:42:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-11-28 02:42:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 02:42:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-11-28 02:42:43,286 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 19 [2019-11-28 02:42:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:43,286 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-11-28 02:42:43,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:42:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-11-28 02:42:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:42:43,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:43,288 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-28 02:42:43,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 02:42:43,499 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash -460498981, now seen corresponding path program 1 times [2019-11-28 02:42:43,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:43,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690544014] [2019-11-28 02:42:43,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:42:43,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:42:43,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:42:43,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:42:43,640 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:43,644 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:43,644 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:43,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 02:42:43,670 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-28 02:42:43,671 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:42:43,673 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:43,673 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:42:43,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2019-11-28 02:42:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:43,683 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:42:43,723 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-28 02:42:43,723 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 02:42:43,728 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:42:43,728 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 02:42:43,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-28 02:42:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:42:43,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690544014] [2019-11-28 02:42:43,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:42:43,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-28 02:42:43,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187645743] [2019-11-28 02:42:43,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:42:43,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:42:43,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:42:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:42:43,740 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 9 states. [2019-11-28 02:42:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:42:44,462 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-11-28 02:42:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:42:44,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-28 02:42:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:42:44,464 INFO L225 Difference]: With dead ends: 135 [2019-11-28 02:42:44,465 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 02:42:44,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:42:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 02:42:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2019-11-28 02:42:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 02:42:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-28 02:42:44,472 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 19 [2019-11-28 02:42:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:42:44,472 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-28 02:42:44,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:42:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-28 02:42:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:42:44,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:42:44,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:42:44,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 02:42:44,687 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:42:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:42:44,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1392190610, now seen corresponding path program 1 times [2019-11-28 02:42:44,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:42:44,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415820441] [2019-11-28 02:42:44,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 02:42:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:42:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:42:44,822 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-28 02:42:44,822 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:42:45,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 02:42:45,047 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 02:42:45,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:42:45 BoogieIcfgContainer [2019-11-28 02:42:45,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:42:45,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:42:45,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:42:45,062 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:42:45,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:33" (3/4) ... [2019-11-28 02:42:45,066 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:42:45,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:42:45,068 INFO L168 Benchmark]: Toolchain (without parser) took 12869.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -269.5 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:45,069 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:42:45,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:45,070 INFO L168 Benchmark]: Boogie Preprocessor took 88.74 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:45,070 INFO L168 Benchmark]: RCFGBuilder took 792.54 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:45,071 INFO L168 Benchmark]: TraceAbstraction took 11341.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -182.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:42:45,072 INFO L168 Benchmark]: Witness Printer took 5.28 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-28 02:42:45,074 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.27 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 636.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.74 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 792.54 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11341.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -182.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.28 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L522] COND FALSE !(a == 0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L523] List t; [L524] List p = a; VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L540] p = a VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L541] EXPR p->h VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=3] [L541] COND FALSE !(p->h == 1) [L543] EXPR p->h VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=3] [L543] COND FALSE !(p->h == 2) [L545] EXPR p->h VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=3] [L545] COND FALSE !(p->h != 3) [L547] return 0; VAL [\result=0, a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 93 locations, 26 error locations. Result: UNSAFE, OverallTime: 11.2s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 383 SDtfs, 902 SDslu, 1298 SDs, 0 SdLazy, 1462 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=9, 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, 9 MinimizatonAttempts, 275 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 18688 SizeOfPredicates, 70 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...