./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.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 62ed6df4fdaf468f52c0eff1159abadc4f432e3d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.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 62ed6df4fdaf468f52c0eff1159abadc4f432e3d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 23:29:29,507 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:29:29,509 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:29:29,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:29:29,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:29:29,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:29:29,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:29:29,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:29:29,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:29:29,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:29:29,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:29:29,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:29:29,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:29:29,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:29:29,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:29:29,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:29:29,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:29:29,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:29:29,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:29:29,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:29:29,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:29:29,545 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:29:29,547 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:29:29,548 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:29:29,548 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:29:29,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:29:29,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:29:29,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:29:29,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:29:29,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:29:29,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:29:29,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:29:29,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:29:29,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:29:29,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:29:29,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:29:29,557 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 23:29:29,572 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:29:29,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:29:29,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:29:29,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:29:29,574 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:29:29,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:29:29,574 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:29:29,575 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:29:29,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:29:29,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:29:29,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:29:29,576 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:29:29,576 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:29:29,576 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:29:29,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:29:29,578 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:29:29,578 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:29:29,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:29:29,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:29:29,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:29:29,578 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:29:29,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:29:29,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:29:29,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:29:29,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 23:29:29,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:29:29,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> 62ed6df4fdaf468f52c0eff1159abadc4f432e3d [2019-01-13 23:29:29,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:29:29,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:29:29,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:29:29,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:29:29,635 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:29:29,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:29,698 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48995b753/b53848a2c83144aa8f39efa79c8f7b90/FLAGc63fef097 [2019-01-13 23:29:30,161 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:29:30,162 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:30,174 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48995b753/b53848a2c83144aa8f39efa79c8f7b90/FLAGc63fef097 [2019-01-13 23:29:30,485 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48995b753/b53848a2c83144aa8f39efa79c8f7b90 [2019-01-13 23:29:30,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:29:30,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:29:30,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:30,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:29:30,496 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:29:30,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:30" (1/1) ... [2019-01-13 23:29:30,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff617d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:30, skipping insertion in model container [2019-01-13 23:29:30,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:30" (1/1) ... [2019-01-13 23:29:30,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:29:30,566 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:29:30,835 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:30,853 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:29:30,919 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:31,050 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:29:31,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31 WrapperNode [2019-01-13 23:29:31,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:31,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:29:31,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:29:31,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:29:31,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:29:31,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:29:31,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:29:31,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:29:31,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (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-01-13 23:29:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:29:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:29:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-13 23:29:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:29:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 23:29:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:29:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:29:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:29:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:29:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:29:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:29:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:29:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:29:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:29:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:29:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:29:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:29:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:29:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:29:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:29:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:29:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:29:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:29:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:29:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:29:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:29:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:29:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:29:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:29:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:29:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:29:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:29:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:29:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:29:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:29:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:29:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:29:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:29:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:29:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:29:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:29:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:29:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:29:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:29:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:29:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:29:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:29:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:29:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:29:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:29:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:29:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:29:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:29:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:29:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:29:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:29:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:29:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-13 23:29:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:29:31,554 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-13 23:29:31,886 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:29:31,886 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 23:29:31,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:31 BoogieIcfgContainer [2019-01-13 23:29:31,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:29:31,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:29:31,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:29:31,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:29:31,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:29:30" (1/3) ... [2019-01-13 23:29:31,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b055c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:31, skipping insertion in model container [2019-01-13 23:29:31,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (2/3) ... [2019-01-13 23:29:31,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b055c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:31, skipping insertion in model container [2019-01-13 23:29:31,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:31" (3/3) ... [2019-01-13 23:29:31,896 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:31,906 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:29:31,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 23:29:31,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 23:29:31,951 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:29:31,951 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:29:31,952 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:29:31,952 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:29:31,953 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:29:31,953 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:29:31,953 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:29:31,953 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:29:31,953 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:29:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-13 23:29:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 23:29:31,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:31,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:31,982 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1635117424, now seen corresponding path program 1 times [2019-01-13 23:29:31,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:32,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:32,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:32,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:32,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:29:32,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 23:29:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 23:29:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 23:29:32,145 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-01-13 23:29:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:32,162 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-13 23:29:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 23:29:32,163 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-13 23:29:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:32,172 INFO L225 Difference]: With dead ends: 49 [2019-01-13 23:29:32,172 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 23:29:32,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 23:29:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 23:29:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 23:29:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 23:29:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-13 23:29:32,214 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 10 [2019-01-13 23:29:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:32,215 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-13 23:29:32,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 23:29:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-13 23:29:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 23:29:32,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:32,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:32,216 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -850992160, now seen corresponding path program 1 times [2019-01-13 23:29:32,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:32,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:32,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:32,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:32,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:32,454 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 4 states. [2019-01-13 23:29:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:32,895 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-01-13 23:29:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:32,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 23:29:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:32,897 INFO L225 Difference]: With dead ends: 49 [2019-01-13 23:29:32,897 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 23:29:32,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 23:29:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-01-13 23:29:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 23:29:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-13 23:29:32,906 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 11 [2019-01-13 23:29:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:32,906 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-13 23:29:32,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-13 23:29:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 23:29:32,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:32,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:32,908 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:32,908 INFO L82 PathProgramCache]: Analyzing trace with hash -850992159, now seen corresponding path program 1 times [2019-01-13 23:29:32,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:32,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:32,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:32,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:32,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:32,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:32,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:32,995 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2019-01-13 23:29:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:33,332 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-01-13 23:29:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:33,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 23:29:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:33,335 INFO L225 Difference]: With dead ends: 56 [2019-01-13 23:29:33,335 INFO L226 Difference]: Without dead ends: 56 [2019-01-13 23:29:33,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-13 23:29:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-13 23:29:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-13 23:29:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 23:29:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-01-13 23:29:33,344 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 11 [2019-01-13 23:29:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:33,345 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-01-13 23:29:33,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-01-13 23:29:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 23:29:33,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:33,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:33,347 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:33,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1777420732, now seen corresponding path program 1 times [2019-01-13 23:29:33,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:33,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:33,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:33,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:33,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:29:33,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:33,570 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2019-01-13 23:29:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:33,727 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-01-13 23:29:33,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:33,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-13 23:29:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:33,730 INFO L225 Difference]: With dead ends: 53 [2019-01-13 23:29:33,731 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 23:29:33,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 23:29:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-01-13 23:29:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 23:29:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-01-13 23:29:33,738 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2019-01-13 23:29:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:33,739 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-01-13 23:29:33,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-01-13 23:29:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:29:33,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:33,742 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:33,742 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -38969261, now seen corresponding path program 1 times [2019-01-13 23:29:33,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:33,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:33,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:33,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:33,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:33,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:33,909 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 6 states. [2019-01-13 23:29:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:34,150 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-01-13 23:29:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:29:34,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-13 23:29:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:34,153 INFO L225 Difference]: With dead ends: 64 [2019-01-13 23:29:34,153 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 23:29:34,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:29:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 23:29:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2019-01-13 23:29:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 23:29:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-01-13 23:29:34,161 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 19 [2019-01-13 23:29:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:34,161 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-01-13 23:29:34,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-01-13 23:29:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:29:34,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:34,162 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:34,163 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:34,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:34,163 INFO L82 PathProgramCache]: Analyzing trace with hash -38969260, now seen corresponding path program 1 times [2019-01-13 23:29:34,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:34,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:34,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:34,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:34,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:34,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:34,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:34,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:34,307 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2019-01-13 23:29:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:34,635 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-13 23:29:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:29:34,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-13 23:29:34,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:34,637 INFO L225 Difference]: With dead ends: 60 [2019-01-13 23:29:34,638 INFO L226 Difference]: Without dead ends: 60 [2019-01-13 23:29:34,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-13 23:29:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2019-01-13 23:29:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-13 23:29:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-01-13 23:29:34,643 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 19 [2019-01-13 23:29:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:34,644 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-01-13 23:29:34,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-01-13 23:29:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 23:29:34,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:34,645 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:34,645 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1662718154, now seen corresponding path program 1 times [2019-01-13 23:29:34,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:34,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:29:34,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:29:34,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:34,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:35,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:29:35,208 INFO L478 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 8 treesize of output 7 [2019-01-13 23:29:35,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:29:35,238 INFO L478 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 8 treesize of output 7 [2019-01-13 23:29:35,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-01-13 23:29:35,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 23:29:35,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 23:29:35,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 23:29:35,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 23:29:35,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-13 23:29:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:35,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:29:35,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 11 [2019-01-13 23:29:35,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 23:29:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 23:29:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:35,443 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2019-01-13 23:29:35,837 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-01-13 23:29:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:35,983 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-13 23:29:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:29:35,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-13 23:29:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:35,987 INFO L225 Difference]: With dead ends: 55 [2019-01-13 23:29:35,987 INFO L226 Difference]: Without dead ends: 55 [2019-01-13 23:29:35,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-01-13 23:29:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-13 23:29:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-01-13 23:29:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 23:29:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-13 23:29:35,992 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 20 [2019-01-13 23:29:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:35,993 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-13 23:29:35,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 23:29:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-13 23:29:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:29:35,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:35,994 INFO L402 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-01-13 23:29:35,994 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION]=== [2019-01-13 23:29:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash 4653910, now seen corresponding path program 1 times [2019-01-13 23:29:35,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:35,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:36,050 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:29:36,066 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 23:29:36,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:29:36 BoogieIcfgContainer [2019-01-13 23:29:36,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:29:36,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:29:36,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:29:36,084 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:29:36,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:31" (3/4) ... [2019-01-13 23:29:36,088 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 23:29:36,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:29:36,089 INFO L168 Benchmark]: Toolchain (without parser) took 5599.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.0 MB in the beginning and 840.6 MB in the end (delta: 105.4 MB). Peak memory consumption was 221.3 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:36,090 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:36,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:36,091 INFO L168 Benchmark]: Boogie Preprocessor took 64.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:36,092 INFO L168 Benchmark]: RCFGBuilder took 770.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:36,093 INFO L168 Benchmark]: TraceAbstraction took 4194.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 840.6 MB in the end (delta: 214.5 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:36,094 INFO L168 Benchmark]: Witness Printer took 4.40 ms. Allocated memory is still 1.1 GB. Free memory is still 840.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:36,098 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 560.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 770.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4194.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 840.6 MB in the end (delta: 214.5 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.40 ms. Allocated memory is still 1.1 GB. Free memory is still 840.6 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: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={3:0}, malloc(sizeof(struct node))={3:0}] [L628] COND FALSE !(a == 0) VAL [a={3:0}, malloc(sizeof(struct node))={3:0}] [L629] List t; [L630] List p = a; VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] p->h = 1 VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L639] p->n = 0 VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L640] p = a VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L641] COND TRUE p!=0 VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L642] EXPR p->h VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR p->n VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={3:0}, malloc(sizeof(struct node))={3:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 15 error locations. UNSAFE Result, 4.1s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 200 SDtfs, 385 SDslu, 278 SDs, 0 SdLazy, 442 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 11238 SizeOfPredicates, 11 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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-0ed9222-m [2019-01-13 23:29:38,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:29:38,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:29:38,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:29:38,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:29:38,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:29:38,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:29:38,417 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:29:38,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:29:38,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:29:38,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:29:38,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:29:38,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:29:38,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:29:38,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:29:38,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:29:38,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:29:38,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:29:38,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:29:38,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:29:38,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:29:38,447 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:29:38,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:29:38,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:29:38,450 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:29:38,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:29:38,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:29:38,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:29:38,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:29:38,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:29:38,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:29:38,456 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:29:38,456 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:29:38,456 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:29:38,458 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:29:38,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:29:38,459 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 23:29:38,482 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:29:38,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:29:38,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:29:38,487 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:29:38,487 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:29:38,487 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:29:38,487 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:29:38,488 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:29:38,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:29:38,488 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:29:38,488 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:29:38,488 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:29:38,488 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:29:38,489 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:29:38,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:29:38,490 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 23:29:38,490 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 23:29:38,491 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:29:38,491 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:29:38,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:29:38,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:29:38,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:29:38,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:29:38,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:29:38,494 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:29:38,494 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:29:38,494 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 23:29:38,495 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:29:38,495 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 23:29:38,495 INFO L133 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 -> 62ed6df4fdaf468f52c0eff1159abadc4f432e3d [2019-01-13 23:29:38,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:29:38,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:29:38,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:29:38,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:29:38,581 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:29:38,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:38,641 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6ac1039/98f05a713b7c4fbf94554673337cbed4/FLAGef4cd7e88 [2019-01-13 23:29:39,135 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:29:39,136 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:39,147 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6ac1039/98f05a713b7c4fbf94554673337cbed4/FLAGef4cd7e88 [2019-01-13 23:29:39,443 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6ac1039/98f05a713b7c4fbf94554673337cbed4 [2019-01-13 23:29:39,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:29:39,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:29:39,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:39,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:29:39,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:29:39,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:39" (1/1) ... [2019-01-13 23:29:39,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb3e5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:39, skipping insertion in model container [2019-01-13 23:29:39,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:39" (1/1) ... [2019-01-13 23:29:39,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:29:39,518 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:29:39,944 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:39,961 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:29:40,080 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:40,143 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:29:40,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40 WrapperNode [2019-01-13 23:29:40,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:40,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:29:40,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:29:40,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:29:40,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (1/1) ... [2019-01-13 23:29:40,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (1/1) ... [2019-01-13 23:29:40,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (1/1) ... [2019-01-13 23:29:40,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (1/1) ... [2019-01-13 23:29:40,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (1/1) ... [2019-01-13 23:29:40,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (1/1) ... [2019-01-13 23:29:40,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (1/1) ... [2019-01-13 23:29:40,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:29:40,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:29:40,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:29:40,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:29:40,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (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-01-13 23:29:40,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:29:40,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:29:40,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 23:29:40,287 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-13 23:29:40,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:29:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 23:29:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:29:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:29:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:29:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:29:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:29:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:29:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:29:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:29:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:29:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:29:40,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:29:40,290 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:29:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:29:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:29:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:29:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:29:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:29:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:29:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:29:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:29:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:29:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:29:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:29:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:29:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:29:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:29:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:29:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:29:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:29:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:29:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:29:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:29:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:29:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:29:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:29:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:29:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:29:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:29:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:29:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:29:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:29:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:29:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:29:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:29:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 23:29:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:29:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:29:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:29:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:29:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:29:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:29:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:29:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:29:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:29:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:29:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:29:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:29:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:29:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:29:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:29:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:29:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:29:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:29:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:29:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:29:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:29:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:29:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:29:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:29:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:29:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:29:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:29:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:29:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:29:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-13 23:29:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:29:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:29:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-13 23:29:40,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:29:40,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:29:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-13 23:29:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:29:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:29:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 23:29:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:29:40,731 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-13 23:29:41,042 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:29:41,044 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 23:29:41,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:41 BoogieIcfgContainer [2019-01-13 23:29:41,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:29:41,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:29:41,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:29:41,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:29:41,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:29:39" (1/3) ... [2019-01-13 23:29:41,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd43714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:41, skipping insertion in model container [2019-01-13 23:29:41,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:40" (2/3) ... [2019-01-13 23:29:41,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd43714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:41, skipping insertion in model container [2019-01-13 23:29:41,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:41" (3/3) ... [2019-01-13 23:29:41,055 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:41,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:29:41,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 23:29:41,092 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 23:29:41,117 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:29:41,118 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:29:41,119 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:29:41,119 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:29:41,120 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:29:41,120 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:29:41,120 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:29:41,120 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:29:41,120 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:29:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-01-13 23:29:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 23:29:41,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:41,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:41,150 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:41,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1212037297, now seen corresponding path program 1 times [2019-01-13 23:29:41,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:41,162 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:41,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:41,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:41,255 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 23:29:41,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:41,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:29:41,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 23:29:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 23:29:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 23:29:41,284 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2019-01-13 23:29:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:41,313 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-01-13 23:29:41,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 23:29:41,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-13 23:29:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:41,322 INFO L225 Difference]: With dead ends: 48 [2019-01-13 23:29:41,322 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 23:29:41,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 23:29:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 23:29:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 23:29:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 23:29:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-13 23:29:41,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 10 [2019-01-13 23:29:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:41,362 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-13 23:29:41,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 23:29:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-13 23:29:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 23:29:41,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:41,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:41,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:41,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1212036615, now seen corresponding path program 1 times [2019-01-13 23:29:41,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:41,365 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:41,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:41,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:41,447 INFO L478 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-01-13 23:29:41,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:41,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:41,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:29:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:41,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:41,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:41,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:41,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:41,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:41,551 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2019-01-13 23:29:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:42,077 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-01-13 23:29:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:42,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 23:29:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:42,079 INFO L225 Difference]: With dead ends: 47 [2019-01-13 23:29:42,079 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 23:29:42,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 23:29:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-13 23:29:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 23:29:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-13 23:29:42,087 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 10 [2019-01-13 23:29:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:42,087 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-13 23:29:42,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-13 23:29:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 23:29:42,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:42,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:42,089 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1212036616, now seen corresponding path program 1 times [2019-01-13 23:29:42,089 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:42,090 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:42,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:42,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:42,184 INFO L478 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-01-13 23:29:42,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:42,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:42,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:29:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:42,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:42,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:42,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:42,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:42,491 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-01-13 23:29:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:43,281 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-13 23:29:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:43,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 23:29:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:43,283 INFO L225 Difference]: With dead ends: 54 [2019-01-13 23:29:43,284 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 23:29:43,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 23:29:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-01-13 23:29:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 23:29:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-01-13 23:29:43,291 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 10 [2019-01-13 23:29:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:43,291 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-01-13 23:29:43,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-01-13 23:29:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 23:29:43,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:43,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:43,292 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1637979771, now seen corresponding path program 1 times [2019-01-13 23:29:43,293 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:43,294 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:43,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:43,386 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:43,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:43,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:29:43,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:43,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:43,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:43,396 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2019-01-13 23:29:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:43,622 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-01-13 23:29:43,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:43,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-13 23:29:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:43,624 INFO L225 Difference]: With dead ends: 51 [2019-01-13 23:29:43,624 INFO L226 Difference]: Without dead ends: 51 [2019-01-13 23:29:43,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-01-13 23:29:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-13 23:29:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-13 23:29:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 23:29:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-01-13 23:29:43,630 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 15 [2019-01-13 23:29:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:43,631 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-01-13 23:29:43,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-01-13 23:29:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:29:43,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:43,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:43,632 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:43,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1414223438, now seen corresponding path program 1 times [2019-01-13 23:29:43,633 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:43,633 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:43,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:43,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:43,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:29:43,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:43,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:43,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-13 23:29:43,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-13 23:29:43,784 INFO L478 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 10 treesize of output 9 [2019-01-13 23:29:43,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:43,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:43,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:43,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-01-13 23:29:43,840 INFO L478 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 17 [2019-01-13 23:29:43,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2019-01-13 23:29:43,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:43,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:43,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:29:43,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-13 23:29:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:43,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:43,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:43,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:43,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:43,901 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2019-01-13 23:29:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:44,338 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-01-13 23:29:44,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:29:44,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-13 23:29:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:44,341 INFO L225 Difference]: With dead ends: 47 [2019-01-13 23:29:44,342 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 23:29:44,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-01-13 23:29:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 23:29:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-13 23:29:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 23:29:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-01-13 23:29:44,349 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 17 [2019-01-13 23:29:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:44,349 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-01-13 23:29:44,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-01-13 23:29:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:29:44,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:44,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:44,352 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1414223437, now seen corresponding path program 1 times [2019-01-13 23:29:44,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:44,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:44,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:44,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:44,493 INFO L478 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-01-13 23:29:44,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:29:44,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-13 23:29:44,551 INFO L478 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 10 treesize of output 9 [2019-01-13 23:29:44,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-13 23:29:44,649 INFO L478 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 10 treesize of output 9 [2019-01-13 23:29:44,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-01-13 23:29:44,695 INFO L478 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 15 [2019-01-13 23:29:44,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-13 23:29:44,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,756 INFO L478 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 19 [2019-01-13 23:29:44,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-01-13 23:29:44,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:44,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-01-13 23:29:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:44,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:44,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:44,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:44,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:44,852 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2019-01-13 23:29:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:45,458 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-13 23:29:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:29:45,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-13 23:29:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:45,461 INFO L225 Difference]: With dead ends: 58 [2019-01-13 23:29:45,461 INFO L226 Difference]: Without dead ends: 58 [2019-01-13 23:29:45,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-13 23:29:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2019-01-13 23:29:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-13 23:29:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-13 23:29:45,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 17 [2019-01-13 23:29:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:45,467 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-13 23:29:45,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-13 23:29:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:29:45,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:45,468 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:45,468 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1011595145, now seen corresponding path program 1 times [2019-01-13 23:29:45,469 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:45,469 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:45,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:45,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:45,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-13 23:29:45,614 INFO L478 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 10 treesize of output 9 [2019-01-13 23:29:45,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-13 23:29:45,693 INFO L478 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 10 treesize of output 9 [2019-01-13 23:29:45,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-01-13 23:29:45,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 23:29:45,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 23:29:45,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 23:29:45,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 23:29:45,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:45,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-13 23:29:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:45,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:29:46,090 INFO L478 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 13 treesize of output 11 [2019-01-13 23:29:46,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-01-13 23:29:46,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:46,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:46,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2019-01-13 23:29:46,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-01-13 23:29:46,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:46,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:46,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:29:46,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-01-13 23:29:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:46,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:29:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-01-13 23:29:46,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 23:29:46,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 23:29:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:46,219 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2019-01-13 23:29:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:46,865 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-01-13 23:29:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:29:46,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-13 23:29:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:46,868 INFO L225 Difference]: With dead ends: 53 [2019-01-13 23:29:46,868 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 23:29:46,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:29:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 23:29:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2019-01-13 23:29:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 23:29:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-01-13 23:29:46,874 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 19 [2019-01-13 23:29:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:46,874 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-01-13 23:29:46,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 23:29:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-01-13 23:29:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 23:29:46,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:46,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:46,875 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION]=== [2019-01-13 23:29:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1294677117, now seen corresponding path program 1 times [2019-01-13 23:29:46,876 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:46,876 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:46,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:47,088 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:29:47,106 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 23:29:47,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:29:47 BoogieIcfgContainer [2019-01-13 23:29:47,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:29:47,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:29:47,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:29:47,124 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:29:47,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:41" (3/4) ... [2019-01-13 23:29:47,134 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 23:29:47,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:29:47,137 INFO L168 Benchmark]: Toolchain (without parser) took 7688.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -233.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:47,139 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:47,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:47,145 INFO L168 Benchmark]: Boogie Preprocessor took 70.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:47,146 INFO L168 Benchmark]: RCFGBuilder took 831.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:47,147 INFO L168 Benchmark]: TraceAbstraction took 6077.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:47,148 INFO L168 Benchmark]: Witness Printer took 10.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:47,154 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 831.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6077.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 10.55 ms. Allocated memory is still 1.2 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: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}] [L628] COND FALSE !(a == 0) VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}] [L629] List t; [L630] List p = a; VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] p->h = 1 VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L639] p->n = 0 VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L640] p = a VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L641] COND TRUE p!=0 VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L642] EXPR p->h VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR p->n VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 52 locations, 15 error locations. UNSAFE Result, 6.0s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 185 SDtfs, 296 SDslu, 265 SDs, 0 SdLazy, 439 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 8981 SizeOfPredicates, 35 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...