./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-14 19:41:08,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:41:08,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:41:08,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:41:08,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:41:08,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:41:08,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:41:08,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:41:08,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:41:08,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:41:08,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:41:08,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:41:08,093 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:41:08,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:41:08,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:41:08,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:41:08,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:41:08,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:41:08,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:41:08,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:41:08,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:41:08,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:41:08,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:41:08,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:41:08,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:41:08,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:41:08,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:41:08,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:41:08,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:41:08,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:41:08,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:41:08,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:41:08,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:41:08,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:41:08,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:41:08,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:41:08,115 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:41:08,136 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:41:08,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:41:08,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:41:08,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:41:08,138 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:41:08,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:41:08,138 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:41:08,138 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:41:08,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:41:08,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:41:08,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:41:08,139 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:41:08,139 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:41:08,139 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:41:08,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:41:08,143 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:41:08,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:41:08,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:41:08,144 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:41:08,144 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:41:08,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:41:08,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:41:08,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:41:08,144 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:41:08,145 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:41:08,145 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-14 19:41:08,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:41:08,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:41:08,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:41:08,208 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:41:08,209 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:41:08,209 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-14 19:41:08,265 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907b70b2a/4c19bf7c696a4090bb5be2452f55b0ca/FLAGbbbe8914b [2019-01-14 19:41:08,791 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:41:08,792 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2019-01-14 19:41:08,805 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907b70b2a/4c19bf7c696a4090bb5be2452f55b0ca/FLAGbbbe8914b [2019-01-14 19:41:09,053 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907b70b2a/4c19bf7c696a4090bb5be2452f55b0ca [2019-01-14 19:41:09,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:41:09,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:41:09,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:41:09,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:41:09,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:41:09,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64194056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09, skipping insertion in model container [2019-01-14 19:41:09,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:41:09,124 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:41:09,470 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:41:09,487 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:41:09,630 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:41:09,700 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:41:09,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09 WrapperNode [2019-01-14 19:41:09,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:41:09,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:41:09,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:41:09,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:41:09,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (1/1) ... [2019-01-14 19:41:09,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:41:09,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:41:09,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:41:09,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:41:09,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (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-14 19:41:09,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:41:09,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:41:09,832 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 19:41:09,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:41:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 19:41:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 19:41:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 19:41:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 19:41:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 19:41:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 19:41:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 19:41:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 19:41:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 19:41:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 19:41:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 19:41:09,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 19:41:09,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 19:41:09,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 19:41:09,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 19:41:09,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 19:41:09,835 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 19:41:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 19:41:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 19:41:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 19:41:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 19:41:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 19:41:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 19:41:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 19:41:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 19:41:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 19:41:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 19:41:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 19:41:09,838 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 19:41:09,838 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 19:41:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 19:41:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 19:41:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 19:41:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 19:41:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 19:41:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 19:41:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 19:41:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 19:41:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 19:41:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 19:41:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 19:41:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 19:41:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 19:41:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 19:41:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 19:41:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 19:41:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 19:41:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 19:41:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 19:41:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 19:41:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 19:41:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 19:41:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 19:41:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 19:41:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 19:41:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 19:41:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 19:41:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 19:41:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 19:41:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 19:41:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 19:41:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 19:41:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 19:41:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 19:41:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 19:41:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 19:41:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 19:41:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 19:41:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 19:41:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 19:41:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 19:41:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 19:41:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 19:41:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 19:41:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 19:41:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 19:41:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 19:41:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 19:41:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:41:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 19:41:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 19:41:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:41:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:41:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:41:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:41:10,158 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 19:41:10,456 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:41:10,456 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 19:41:10,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:41:10 BoogieIcfgContainer [2019-01-14 19:41:10,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:41:10,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:41:10,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:41:10,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:41:10,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:41:09" (1/3) ... [2019-01-14 19:41:10,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a97f7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:41:10, skipping insertion in model container [2019-01-14 19:41:10,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:09" (2/3) ... [2019-01-14 19:41:10,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a97f7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:41:10, skipping insertion in model container [2019-01-14 19:41:10,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:41:10" (3/3) ... [2019-01-14 19:41:10,466 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2019-01-14 19:41:10,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:41:10,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-14 19:41:10,500 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-14 19:41:10,525 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:41:10,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:41:10,526 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:41:10,526 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:41:10,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:41:10,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:41:10,527 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:41:10,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:41:10,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:41:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-14 19:41:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 19:41:10,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:10,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:10,557 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1635117424, now seen corresponding path program 1 times [2019-01-14 19:41:10,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:10,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:10,698 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-14 19:41:10,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:10,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:41:10,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 19:41:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 19:41:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 19:41:10,719 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-01-14 19:41:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:10,736 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-14 19:41:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 19:41:10,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-14 19:41:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:10,746 INFO L225 Difference]: With dead ends: 49 [2019-01-14 19:41:10,746 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 19:41:10,748 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-14 19:41:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 19:41:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 19:41:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 19:41:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-14 19:41:10,787 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 10 [2019-01-14 19:41:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:10,788 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-14 19:41:10,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 19:41:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-14 19:41:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 19:41:10,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:10,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:10,789 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash -850992160, now seen corresponding path program 1 times [2019-01-14 19:41:10,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:10,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:10,917 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-14 19:41:10,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:10,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:41:10,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:41:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:41:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:41:10,920 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 4 states. [2019-01-14 19:41:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:11,337 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-01-14 19:41:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:41:11,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 19:41:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:11,339 INFO L225 Difference]: With dead ends: 49 [2019-01-14 19:41:11,339 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 19:41:11,340 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-14 19:41:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 19:41:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-01-14 19:41:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 19:41:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-14 19:41:11,347 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 11 [2019-01-14 19:41:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:11,348 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-14 19:41:11,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:41:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-14 19:41:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 19:41:11,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:11,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:11,349 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash -850992159, now seen corresponding path program 1 times [2019-01-14 19:41:11,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:11,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:11,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:11,443 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-14 19:41:11,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:11,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:41:11,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:41:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:41:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:41:11,446 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2019-01-14 19:41:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:11,754 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-01-14 19:41:11,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:41:11,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 19:41:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:11,758 INFO L225 Difference]: With dead ends: 56 [2019-01-14 19:41:11,758 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 19:41:11,760 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-14 19:41:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 19:41:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-14 19:41:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 19:41:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-01-14 19:41:11,773 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 11 [2019-01-14 19:41:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-01-14 19:41:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:41:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-01-14 19:41:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:41:11,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:11,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:11,776 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1777420732, now seen corresponding path program 1 times [2019-01-14 19:41:11,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:11,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:11,966 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-14 19:41:11,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:11,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:41:11,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:41:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:41:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:41:11,968 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2019-01-14 19:41:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:12,133 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-01-14 19:41:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:41:12,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-14 19:41:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:12,136 INFO L225 Difference]: With dead ends: 53 [2019-01-14 19:41:12,137 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 19:41:12,139 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-14 19:41:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 19:41:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-01-14 19:41:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 19:41:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-01-14 19:41:12,145 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2019-01-14 19:41:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:12,145 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-01-14 19:41:12,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:41:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-01-14 19:41:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 19:41:12,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:12,147 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-14 19:41:12,147 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash -38969261, now seen corresponding path program 1 times [2019-01-14 19:41:12,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:12,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:12,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:12,310 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-14 19:41:12,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:12,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:41:12,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:41:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:41:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:41:12,312 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 6 states. [2019-01-14 19:41:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:12,522 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-01-14 19:41:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:41:12,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 19:41:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:12,524 INFO L225 Difference]: With dead ends: 64 [2019-01-14 19:41:12,524 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 19:41:12,525 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-14 19:41:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 19:41:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2019-01-14 19:41:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 19:41:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-01-14 19:41:12,532 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 19 [2019-01-14 19:41:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:12,532 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-01-14 19:41:12,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:41:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-01-14 19:41:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 19:41:12,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:12,533 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-14 19:41:12,534 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash -38969260, now seen corresponding path program 1 times [2019-01-14 19:41:12,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:12,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:12,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:12,660 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-14 19:41:12,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:12,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:41:12,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:41:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:41:12,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:41:12,662 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2019-01-14 19:41:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:13,023 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-14 19:41:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:41:13,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 19:41:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:13,025 INFO L225 Difference]: With dead ends: 60 [2019-01-14 19:41:13,026 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 19:41:13,026 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-14 19:41:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 19:41:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2019-01-14 19:41:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 19:41:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-01-14 19:41:13,031 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 19 [2019-01-14 19:41:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:13,031 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-01-14 19:41:13,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:41:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-01-14 19:41:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 19:41:13,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:13,032 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-14 19:41:13,033 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1662718154, now seen corresponding path program 1 times [2019-01-14 19:41:13,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:13,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:13,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:13,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:13,335 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-14 19:41:13,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:41:13,336 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-14 19:41:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:13,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:13,526 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-14 19:41:13,528 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-14 19:41:13,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,558 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-14 19:41:13,561 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-14 19:41:13,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-01-14 19:41:13,665 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-14 19:41:13,671 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-14 19:41:13,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,687 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-14 19:41:13,690 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-14 19:41:13,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:13,704 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-14 19:41:13,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-14 19:41:13,735 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-14 19:41:13,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:41:13,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 11 [2019-01-14 19:41:13,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:41:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:41:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:41:13,756 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2019-01-14 19:41:14,048 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-01-14 19:41:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:14,568 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-14 19:41:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:41:14,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-14 19:41:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:14,572 INFO L225 Difference]: With dead ends: 55 [2019-01-14 19:41:14,572 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 19:41:14,573 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-14 19:41:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 19:41:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-01-14 19:41:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 19:41:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-14 19:41:14,581 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 20 [2019-01-14 19:41:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:14,582 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-14 19:41:14,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:41:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-14 19:41:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:41:14,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:14,585 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-14 19:41:14,586 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 19:41:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash 4653910, now seen corresponding path program 1 times [2019-01-14 19:41:14,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:41:14,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:41:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:14,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:41:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:41:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:41:14,658 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 19:41:14,669 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 19:41:14,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:41:14 BoogieIcfgContainer [2019-01-14 19:41:14,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:41:14,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:41:14,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:41:14,684 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:41:14,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:41:10" (3/4) ... [2019-01-14 19:41:14,689 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 19:41:14,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:41:14,690 INFO L168 Benchmark]: Toolchain (without parser) took 5633.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 950.0 MB in the beginning and 822.4 MB in the end (delta: 127.6 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:41:14,691 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:41:14,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:41:14,693 INFO L168 Benchmark]: Boogie Preprocessor took 76.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:41:14,693 INFO L168 Benchmark]: RCFGBuilder took 680.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-01-14 19:41:14,694 INFO L168 Benchmark]: TraceAbstraction took 4224.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 822.4 MB in the end (delta: 218.9 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:41:14,695 INFO L168 Benchmark]: Witness Printer took 5.41 ms. Allocated memory is still 1.1 GB. Free memory is still 822.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:41:14,699 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 680.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4224.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 822.4 MB in the end (delta: 218.9 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.41 ms. Allocated memory is still 1.1 GB. Free memory is still 822.4 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.3s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s 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.2s SatisfiabilityAnalysisTime, 1.2s 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-14 19:41:16,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:41:16,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:41:16,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:41:16,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:41:16,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:41:16,957 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:41:16,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:41:16,961 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:41:16,962 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:41:16,963 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:41:16,963 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:41:16,964 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:41:16,965 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:41:16,967 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:41:16,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:41:16,968 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:41:16,970 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:41:16,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:41:16,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:41:16,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:41:16,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:41:16,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:41:16,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:41:16,980 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:41:16,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:41:16,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:41:16,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:41:16,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:41:16,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:41:16,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:41:16,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:41:16,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:41:16,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:41:16,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:41:16,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:41:16,989 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-14 19:41:17,004 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:41:17,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:41:17,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:41:17,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:41:17,007 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:41:17,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:41:17,007 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:41:17,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:41:17,007 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:41:17,007 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:41:17,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:41:17,008 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:41:17,008 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:41:17,008 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:41:17,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:41:17,009 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 19:41:17,010 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 19:41:17,010 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:41:17,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:41:17,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:41:17,011 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:41:17,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:41:17,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:41:17,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:41:17,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:41:17,013 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 19:41:17,013 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:41:17,013 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 19:41:17,013 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-14 19:41:17,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:41:17,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:41:17,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:41:17,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:41:17,070 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:41:17,071 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-14 19:41:17,136 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57369dce1/095c6d65a42741baa75edda935b60225/FLAGf29951cf5 [2019-01-14 19:41:17,671 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:41:17,674 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2019-01-14 19:41:17,689 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57369dce1/095c6d65a42741baa75edda935b60225/FLAGf29951cf5 [2019-01-14 19:41:17,911 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57369dce1/095c6d65a42741baa75edda935b60225 [2019-01-14 19:41:17,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:41:17,917 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:41:17,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:41:17,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:41:17,922 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:41:17,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:41:17" (1/1) ... [2019-01-14 19:41:17,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74090b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:17, skipping insertion in model container [2019-01-14 19:41:17,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:41:17" (1/1) ... [2019-01-14 19:41:17,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:41:17,981 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:41:18,371 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:41:18,392 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:41:18,514 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:41:18,571 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:41:18,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18 WrapperNode [2019-01-14 19:41:18,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:41:18,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:41:18,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:41:18,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:41:18,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (1/1) ... [2019-01-14 19:41:18,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (1/1) ... [2019-01-14 19:41:18,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (1/1) ... [2019-01-14 19:41:18,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (1/1) ... [2019-01-14 19:41:18,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (1/1) ... [2019-01-14 19:41:18,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (1/1) ... [2019-01-14 19:41:18,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (1/1) ... [2019-01-14 19:41:18,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:41:18,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:41:18,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:41:18,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:41:18,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (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-14 19:41:18,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:41:18,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:41:18,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 19:41:18,723 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 19:41:18,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:41:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 19:41:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 19:41:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 19:41:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 19:41:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 19:41:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 19:41:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 19:41:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 19:41:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 19:41:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 19:41:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 19:41:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 19:41:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 19:41:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 19:41:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 19:41:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 19:41:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 19:41:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 19:41:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 19:41:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 19:41:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 19:41:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 19:41:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 19:41:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 19:41:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 19:41:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 19:41:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 19:41:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 19:41:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 19:41:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 19:41:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 19:41:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 19:41:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 19:41:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 19:41:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 19:41:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 19:41:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 19:41:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 19:41:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 19:41:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 19:41:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 19:41:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 19:41:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 19:41:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 19:41:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 19:41:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 19:41:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 19:41:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 19:41:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 19:41:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 19:41:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 19:41:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 19:41:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 19:41:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 19:41:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 19:41:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 19:41:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 19:41:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 19:41:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 19:41:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 19:41:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 19:41:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 19:41:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 19:41:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 19:41:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 19:41:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 19:41:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 19:41:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 19:41:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 19:41:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 19:41:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 19:41:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 19:41:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 19:41:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 19:41:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 19:41:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 19:41:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 19:41:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 19:41:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 19:41:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 19:41:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 19:41:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 19:41:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 19:41:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 19:41:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 19:41:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 19:41:18,748 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 19:41:18,748 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 19:41:18,748 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 19:41:18,749 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 19:41:18,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:41:18,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 19:41:18,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 19:41:18,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 19:41:18,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 19:41:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 19:41:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:41:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:41:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 19:41:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:41:19,175 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 19:41:19,477 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:41:19,478 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 19:41:19,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:41:19 BoogieIcfgContainer [2019-01-14 19:41:19,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:41:19,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:41:19,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:41:19,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:41:19,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:41:17" (1/3) ... [2019-01-14 19:41:19,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec7c6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:41:19, skipping insertion in model container [2019-01-14 19:41:19,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:41:18" (2/3) ... [2019-01-14 19:41:19,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec7c6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:41:19, skipping insertion in model container [2019-01-14 19:41:19,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:41:19" (3/3) ... [2019-01-14 19:41:19,488 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2019-01-14 19:41:19,499 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:41:19,507 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-14 19:41:19,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-14 19:41:19,547 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:41:19,548 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:41:19,548 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:41:19,549 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:41:19,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:41:19,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:41:19,550 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:41:19,550 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:41:19,550 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:41:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-01-14 19:41:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 19:41:19,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:19,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:19,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:19,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1212037297, now seen corresponding path program 1 times [2019-01-14 19:41:19,587 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:19,588 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-14 19:41:19,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:19,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:19,683 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-14 19:41:19,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:41:19,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:19,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:41:19,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 19:41:19,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 19:41:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 19:41:19,715 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2019-01-14 19:41:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:19,741 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-01-14 19:41:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 19:41:19,742 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-14 19:41:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:19,749 INFO L225 Difference]: With dead ends: 48 [2019-01-14 19:41:19,749 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 19:41:19,750 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-14 19:41:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 19:41:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 19:41:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 19:41:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-14 19:41:19,788 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 10 [2019-01-14 19:41:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:19,788 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-14 19:41:19,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 19:41:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-14 19:41:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 19:41:19,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:19,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:19,791 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1212036615, now seen corresponding path program 1 times [2019-01-14 19:41:19,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:19,792 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-14 19:41:19,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:19,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:19,892 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-14 19:41:19,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:19,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:19,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 19:41:19,988 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-14 19:41:19,988 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:41:19,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:19,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:41:19,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:41:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:41:19,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:41:19,995 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2019-01-14 19:41:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:20,484 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-01-14 19:41:20,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:41:20,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 19:41:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:20,487 INFO L225 Difference]: With dead ends: 47 [2019-01-14 19:41:20,487 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 19:41:20,488 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-14 19:41:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 19:41:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-14 19:41:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 19:41:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-14 19:41:20,496 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 10 [2019-01-14 19:41:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:20,497 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-14 19:41:20,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:41:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-14 19:41:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 19:41:20,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:20,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:20,498 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:20,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1212036616, now seen corresponding path program 1 times [2019-01-14 19:41:20,500 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:20,500 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-14 19:41:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:20,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:20,588 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-14 19:41:20,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:20,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:20,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:41:20,637 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-14 19:41:20,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:41:20,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:41:20,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:41:20,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:41:20,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:41:20,642 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-01-14 19:41:20,825 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 19:41:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:21,354 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-14 19:41:21,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:41:21,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 19:41:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:21,356 INFO L225 Difference]: With dead ends: 54 [2019-01-14 19:41:21,356 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 19:41:21,357 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-14 19:41:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 19:41:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-01-14 19:41:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 19:41:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-01-14 19:41:21,364 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 10 [2019-01-14 19:41:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:21,364 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-01-14 19:41:21,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:41:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-01-14 19:41:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:41:21,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:21,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:21,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1637979771, now seen corresponding path program 1 times [2019-01-14 19:41:21,367 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:21,367 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-14 19:41:21,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:21,547 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-14 19:41:21,548 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:41:21,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:21,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:41:21,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 19:41:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 19:41:21,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 19:41:21,555 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2019-01-14 19:41:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:21,907 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-01-14 19:41:21,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:41:21,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 19:41:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:21,910 INFO L225 Difference]: With dead ends: 51 [2019-01-14 19:41:21,910 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 19:41:21,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-14 19:41:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 19:41:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-14 19:41:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 19:41:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-01-14 19:41:21,916 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 15 [2019-01-14 19:41:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:21,916 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-01-14 19:41:21,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 19:41:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-01-14 19:41:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:41:21,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:21,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:21,919 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1414223438, now seen corresponding path program 1 times [2019-01-14 19:41:21,920 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:21,920 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-14 19:41:21,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:21,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:22,021 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-14 19:41:22,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-14 19:41:22,060 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-14 19:41:22,079 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-14 19:41:22,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,108 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-14 19:41:22,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-01-14 19:41:22,141 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-14 19:41:22,147 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-14 19:41:22,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,160 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-14 19:41:22,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-14 19:41:22,195 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-14 19:41:22,195 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:41:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:41:22,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:41:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:41:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:41:22,198 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2019-01-14 19:41:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:22,614 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-01-14 19:41:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:41:22,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 19:41:22,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:22,617 INFO L225 Difference]: With dead ends: 47 [2019-01-14 19:41:22,618 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 19:41:22,618 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-14 19:41:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 19:41:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-14 19:41:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 19:41:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-01-14 19:41:22,624 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 17 [2019-01-14 19:41:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:22,625 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-01-14 19:41:22,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:41:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-01-14 19:41:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:41:22,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:22,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:41:22,627 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1414223437, now seen corresponding path program 1 times [2019-01-14 19:41:22,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:22,627 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-14 19:41:22,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:22,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:22,749 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-14 19:41:22,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:41:22,877 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-14 19:41:22,900 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-14 19:41:22,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:22,989 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-14 19:41:22,994 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-14 19:41:22,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,019 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-14 19:41:23,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-01-14 19:41:23,048 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-14 19:41:23,064 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-14 19:41:23,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,111 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-14 19:41:23,115 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-14 19:41:23,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,127 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-14 19:41:23,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-01-14 19:41:23,176 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-14 19:41:23,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 19:41:23,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:41:23,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:41:23,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:41:23,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:41:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:41:23,180 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2019-01-14 19:41:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:23,766 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-14 19:41:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:41:23,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 19:41:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:23,768 INFO L225 Difference]: With dead ends: 58 [2019-01-14 19:41:23,768 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 19:41:23,770 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-14 19:41:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 19:41:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2019-01-14 19:41:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 19:41:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-14 19:41:23,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 17 [2019-01-14 19:41:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:23,775 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-14 19:41:23,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:41:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-14 19:41:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 19:41:23,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:23,778 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-14 19:41:23,778 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:23,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1011595145, now seen corresponding path program 1 times [2019-01-14 19:41:23,779 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:23,779 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-14 19:41:23,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:41:23,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:41:23,902 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-14 19:41:23,907 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-14 19:41:23,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,965 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-14 19:41:23,976 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-14 19:41:23,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:23,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-01-14 19:41:24,049 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-14 19:41:24,052 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-14 19:41:24,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,068 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-14 19:41:24,071 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-14 19:41:24,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,087 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-14 19:41:24,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-14 19:41:24,119 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-14 19:41:24,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 19:41:24,329 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-14 19:41:24,334 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-14 19:41:24,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,340 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-14 19:41:24,344 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-14 19:41:24,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:41:24,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 19:41:24,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-01-14 19:41:24,411 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-14 19:41:24,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:41:24,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-01-14 19:41:24,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:41:24,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:41:24,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:41:24,423 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2019-01-14 19:41:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:41:25,023 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-01-14 19:41:25,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:41:25,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-14 19:41:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:41:25,026 INFO L225 Difference]: With dead ends: 53 [2019-01-14 19:41:25,026 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 19:41:25,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:41:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 19:41:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2019-01-14 19:41:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 19:41:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-01-14 19:41:25,032 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 19 [2019-01-14 19:41:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:41:25,032 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-01-14 19:41:25,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:41:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-01-14 19:41:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 19:41:25,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:41:25,033 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-14 19:41:25,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION]=== [2019-01-14 19:41:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:41:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1294677117, now seen corresponding path program 1 times [2019-01-14 19:41:25,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 19:41:25,036 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-14 19:41:25,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:41:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:41:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 19:41:25,266 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 19:41:25,279 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 19:41:25,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:41:25 BoogieIcfgContainer [2019-01-14 19:41:25,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:41:25,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:41:25,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:41:25,299 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:41:25,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:41:19" (3/4) ... [2019-01-14 19:41:25,305 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 19:41:25,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:41:25,306 INFO L168 Benchmark]: Toolchain (without parser) took 7390.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -231.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:41:25,309 INFO L168 Benchmark]: CDTParser took 0.24 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-14 19:41:25,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:41:25,311 INFO L168 Benchmark]: Boogie Preprocessor took 83.35 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-14 19:41:25,312 INFO L168 Benchmark]: RCFGBuilder took 823.03 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.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-01-14 19:41:25,314 INFO L168 Benchmark]: TraceAbstraction took 5817.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:41:25,315 INFO L168 Benchmark]: Witness Printer took 7.03 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-14 19:41:25,320 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.24 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 653.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.35 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 823.03 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.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5817.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 7.03 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, 5.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 3.2s 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.1s 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.5s 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...