./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.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/memsafety/test-0019_false-valid-memtrack_true-termination.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 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/memsafety/test-0019_false-valid-memtrack_true-termination.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 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:22:01,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:22:01,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:22:01,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:22:01,132 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:22:01,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:22:01,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:22:01,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:22:01,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:22:01,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:22:01,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:22:01,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:22:01,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:22:01,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:22:01,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:22:01,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:22:01,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:22:01,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:22:01,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:22:01,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:22:01,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:22:01,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:22:01,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:22:01,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:22:01,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:22:01,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:22:01,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:22:01,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:22:01,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:22:01,166 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:22:01,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:22:01,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:22:01,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:22:01,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:22:01,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:22:01,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:22:01,170 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:22:01,188 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:22:01,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:22:01,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:22:01,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:22:01,190 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:22:01,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:22:01,190 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:22:01,190 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:22:01,190 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:22:01,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:22:01,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:22:01,192 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:22:01,192 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:22:01,192 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:22:01,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:22:01,192 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:22:01,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:22:01,193 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:22:01,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:22:01,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:22:01,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:22:01,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:22:01,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:22:01,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:22:01,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:22:01,196 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 -> 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 [2019-01-14 18:22:01,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:22:01,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:22:01,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:22:01,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:22:01,251 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:22:01,251 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-14 18:22:01,314 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6a2f257/aef3843a0fc34b1784a5453d2724e7b8/FLAGb73c1f8da [2019-01-14 18:22:01,822 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:22:01,824 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-14 18:22:01,836 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6a2f257/aef3843a0fc34b1784a5453d2724e7b8/FLAGb73c1f8da [2019-01-14 18:22:02,108 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6a2f257/aef3843a0fc34b1784a5453d2724e7b8 [2019-01-14 18:22:02,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:22:02,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:22:02,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:02,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:22:02,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:22:02,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f8ae2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02, skipping insertion in model container [2019-01-14 18:22:02,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:22:02,189 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:22:02,504 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:02,519 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:22:02,601 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:02,768 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:22:02,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02 WrapperNode [2019-01-14 18:22:02,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:02,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:22:02,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:22:02,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:22:02,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (1/1) ... [2019-01-14 18:22:02,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:22:02,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:22:02,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:22:02,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:22:02,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (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 18:22:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:22:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:22:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-14 18:22:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-14 18:22:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:22:02,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:22:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:22:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:22:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:22:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:22:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:22:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:22:02,918 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:22:02,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:22:02,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:22:02,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:22:02,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:22:02,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:22:02,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:22:02,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:22:02,920 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:22:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:22:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:22:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:22:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:22:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:22:02,923 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:22:02,923 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:22:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:22:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:22:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:22:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:22:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:22:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:22:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:22:02,925 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:22:02,926 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:22:02,927 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:22:02,928 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:22:02,928 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:22:02,928 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:22:02,928 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:22:02,928 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:22:02,928 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:22:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:22:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:22:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:22:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:22:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:22:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:22:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:22:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:22:02,931 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:22:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:22:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:22:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:22:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:22:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:22:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:22:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:22:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:22:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:22:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:22:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:22:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:22:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:22:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:22:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:22:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:22:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:22:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:22:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:22:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:22:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:22:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:22:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:22:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:22:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:22:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:22:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:22:02,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:22:03,657 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:22:03,657 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-14 18:22:03,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:03 BoogieIcfgContainer [2019-01-14 18:22:03,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:22:03,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:22:03,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:22:03,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:22:03,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:22:02" (1/3) ... [2019-01-14 18:22:03,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f21114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:03, skipping insertion in model container [2019-01-14 18:22:03,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:02" (2/3) ... [2019-01-14 18:22:03,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f21114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:03, skipping insertion in model container [2019-01-14 18:22:03,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:03" (3/3) ... [2019-01-14 18:22:03,671 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2019-01-14 18:22:03,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:22:03,689 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-01-14 18:22:03,702 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-01-14 18:22:03,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:22:03,728 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:22:03,728 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:22:03,728 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:22:03,729 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:22:03,729 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:22:03,729 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:22:03,729 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:22:03,730 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:22:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-01-14 18:22:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:03,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:03,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:03,761 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash 682489329, now seen corresponding path program 1 times [2019-01-14 18:22:03,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:03,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:03,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:03,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:03,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:04,059 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 18:22:04,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:04,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:04,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:04,079 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2019-01-14 18:22:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:04,496 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-14 18:22:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:04,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:04,506 INFO L225 Difference]: With dead ends: 52 [2019-01-14 18:22:04,506 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 18:22:04,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 18:22:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-14 18:22:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 18:22:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-14 18:22:04,544 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-01-14 18:22:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:04,544 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-14 18:22:04,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-14 18:22:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:04,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:04,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:04,546 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash 682489330, now seen corresponding path program 1 times [2019-01-14 18:22:04,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:04,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:04,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:04,707 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 18:22:04,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:04,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:04,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:04,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:04,710 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-01-14 18:22:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:05,158 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-14 18:22:05,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:05,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:05,161 INFO L225 Difference]: With dead ends: 48 [2019-01-14 18:22:05,161 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 18:22:05,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 18:22:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-14 18:22:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 18:22:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-14 18:22:05,171 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-01-14 18:22:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:05,171 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-14 18:22:05,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-14 18:22:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:22:05,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:05,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:05,172 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1257751693, now seen corresponding path program 1 times [2019-01-14 18:22:05,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:05,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:05,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:05,381 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 18:22:05,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:22:05,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:22:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:22:05,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:05,383 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 6 states. [2019-01-14 18:22:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:05,574 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-14 18:22:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:22:05,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-14 18:22:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:05,577 INFO L225 Difference]: With dead ends: 47 [2019-01-14 18:22:05,577 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 18:22:05,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 18:22:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-14 18:22:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 18:22:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-14 18:22:05,585 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-01-14 18:22:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:05,585 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-14 18:22:05,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:22:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-14 18:22:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:22:05,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:05,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:05,587 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:05,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1615622142, now seen corresponding path program 1 times [2019-01-14 18:22:05,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:05,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:05,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:05,715 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 18:22:05,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:05,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:05,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:05,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:05,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:05,717 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2019-01-14 18:22:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:05,935 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-14 18:22:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:05,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-14 18:22:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:05,937 INFO L225 Difference]: With dead ends: 51 [2019-01-14 18:22:05,937 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 18:22:05,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 18:22:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-01-14 18:22:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:22:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-14 18:22:05,946 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2019-01-14 18:22:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:05,946 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-14 18:22:05,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-14 18:22:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:22:05,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:05,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:05,953 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1615622141, now seen corresponding path program 1 times [2019-01-14 18:22:05,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:05,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:05,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:06,162 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 18:22:06,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:06,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:22:06,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:22:06,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:22:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:06,164 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2019-01-14 18:22:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:06,313 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-14 18:22:06,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:06,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-14 18:22:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:06,315 INFO L225 Difference]: With dead ends: 41 [2019-01-14 18:22:06,315 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:22:06,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:22:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 18:22:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:22:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-14 18:22:06,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2019-01-14 18:22:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:06,323 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-14 18:22:06,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:22:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-14 18:22:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 18:22:06,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:06,324 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 18:22:06,324 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash -185755720, now seen corresponding path program 1 times [2019-01-14 18:22:06,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:06,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:06,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:06,531 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 18:22:06,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:06,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:22:06,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:22:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:22:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:06,533 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 10 states. [2019-01-14 18:22:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:06,798 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-14 18:22:06,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:22:06,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-14 18:22:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:06,800 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:22:06,801 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:22:06,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:22:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:22:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 18:22:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:22:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-14 18:22:06,807 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2019-01-14 18:22:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:06,807 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-14 18:22:06,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:22:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-14 18:22:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:22:06,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:06,810 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, 1] [2019-01-14 18:22:06,810 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1463459962, now seen corresponding path program 1 times [2019-01-14 18:22:06,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:06,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:06,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:07,146 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 18:22:07,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:07,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:22:07,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:22:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:22:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:07,148 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 10 states. [2019-01-14 18:22:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:07,423 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-14 18:22:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:22:07,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-14 18:22:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:07,426 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:22:07,426 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:22:07,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:22:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:22:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-14 18:22:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:22:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-14 18:22:07,430 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 22 [2019-01-14 18:22:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:07,431 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-14 18:22:07,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:22:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-14 18:22:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:22:07,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:07,432 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, 1, 1] [2019-01-14 18:22:07,433 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1877381498, now seen corresponding path program 1 times [2019-01-14 18:22:07,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:07,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:07,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:07,610 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 18:22:07,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:07,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:22:07,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:22:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:22:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:07,612 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2019-01-14 18:22:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:08,072 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-14 18:22:08,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:22:08,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-14 18:22:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:08,077 INFO L225 Difference]: With dead ends: 41 [2019-01-14 18:22:08,078 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:22:08,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:22:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:22:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-01-14 18:22:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 18:22:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-14 18:22:08,082 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2019-01-14 18:22:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:08,083 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-14 18:22:08,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:22:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-14 18:22:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:22:08,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:08,084 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, 1, 1, 1] [2019-01-14 18:22:08,084 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1930715640, now seen corresponding path program 1 times [2019-01-14 18:22:08,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:08,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:08,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:08,231 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 18:22:08,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:08,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:22:08,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:22:08,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:22:08,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:22:08,234 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 4 states. [2019-01-14 18:22:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:08,350 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-14 18:22:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:22:08,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-14 18:22:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:08,352 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:22:08,352 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:22:08,353 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 18:22:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:22:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-14 18:22:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 18:22:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-14 18:22:08,356 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 24 [2019-01-14 18:22:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:08,357 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-14 18:22:08,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:22:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-14 18:22:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:22:08,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:08,358 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, 1, 1, 1, 1] [2019-01-14 18:22:08,358 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash 277357372, now seen corresponding path program 1 times [2019-01-14 18:22:08,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:08,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:08,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:08,458 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 18:22:08,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:08,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:08,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:08,459 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 5 states. [2019-01-14 18:22:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:08,488 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-14 18:22:08,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:22:08,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-14 18:22:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:08,491 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:22:08,491 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:22:08,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:22:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-14 18:22:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 18:22:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-14 18:22:08,497 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2019-01-14 18:22:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:08,498 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-14 18:22:08,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-14 18:22:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:22:08,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:08,501 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, 1, 1, 1, 1, 1] [2019-01-14 18:22:08,501 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -36549633, now seen corresponding path program 1 times [2019-01-14 18:22:08,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:08,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:08,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:22:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:22:08,573 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:22:08,598 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:22:08,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:22:08 BoogieIcfgContainer [2019-01-14 18:22:08,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:22:08,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:22:08,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:22:08,620 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:22:08,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:03" (3/4) ... [2019-01-14 18:22:08,631 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:22:08,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:22:08,632 INFO L168 Benchmark]: Toolchain (without parser) took 6520.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:22:08,637 INFO L168 Benchmark]: CDTParser took 0.15 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 18:22:08,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:08,638 INFO L168 Benchmark]: Boogie Preprocessor took 86.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:08,641 INFO L168 Benchmark]: RCFGBuilder took 802.51 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:08,641 INFO L168 Benchmark]: TraceAbstraction took 4958.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:22:08,643 INFO L168 Benchmark]: Witness Printer took 11.80 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 18:22:08,648 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.15 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 653.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 802.51 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4958.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 11.80 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: 639]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 639. Possible FailurePath: [L640] TData data; VAL [data={-3:0}] [L641] CALL alloc_data(&data) VAL [pdata={-3:0}] [L625] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={-3:0}, pdata={-3:0}] [L626] pdata->hi = malloc(24) VAL [malloc(16)={-1:0}, malloc(24)={1:0}, pdata={-3:0}, pdata={-3:0}] [L641] RET alloc_data(&data) VAL [data={-3:0}] [L642] CALL free_data(&data) VAL [data={-3:0}] [L630] EXPR data->lo VAL [data={-3:0}, data={-3:0}, data->lo={-1:0}] [L630] void *lo = data->lo; [L631] EXPR data->hi VAL [data={-3:0}, data={-3:0}, data->hi={1:0}, lo={-1:0}] [L631] void *hi = data->hi; [L632] COND FALSE !(lo == hi) VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L636] data->lo = (void *) 0 VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L637] data->hi = (void *) 0 VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L642] RET free_data(&data) VAL [data={-3:0}] [L643] return 0; [L643] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 19 error locations. UNSAFE Result, 4.9s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 319 SDtfs, 282 SDslu, 818 SDs, 0 SdLazy, 831 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 12614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 18:22:10,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:22:10,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:22:10,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:22:10,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:22:10,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:22:10,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:22:10,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:22:10,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:22:10,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:22:10,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:22:10,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:22:10,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:22:10,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:22:10,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:22:10,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:22:10,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:22:10,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:22:10,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:22:10,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:22:10,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:22:10,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:22:10,969 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:22:10,969 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:22:10,970 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:22:10,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:22:10,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:22:10,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:22:10,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:22:10,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:22:10,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:22:10,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:22:10,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:22:10,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:22:10,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:22:10,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:22:10,986 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-14 18:22:11,013 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:22:11,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:22:11,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:22:11,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:22:11,015 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:22:11,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:22:11,016 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:22:11,016 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:22:11,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:22:11,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:22:11,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:22:11,017 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:22:11,017 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:22:11,017 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:22:11,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:22:11,017 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 18:22:11,018 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 18:22:11,019 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:22:11,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:22:11,020 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:22:11,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:22:11,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:22:11,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:22:11,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:22:11,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:22:11,021 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 18:22:11,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:22:11,022 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 18:22:11,022 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 -> 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 [2019-01-14 18:22:11,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:22:11,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:22:11,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:22:11,080 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:22:11,080 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:22:11,081 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-14 18:22:11,150 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb1d8131/128bb486393a430c82c275546507853b/FLAG154ccab80 [2019-01-14 18:22:11,659 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:22:11,660 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-14 18:22:11,673 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb1d8131/128bb486393a430c82c275546507853b/FLAG154ccab80 [2019-01-14 18:22:11,954 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb1d8131/128bb486393a430c82c275546507853b [2019-01-14 18:22:11,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:22:11,960 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:22:11,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:11,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:22:11,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:22:11,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:11" (1/1) ... [2019-01-14 18:22:11,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:11, skipping insertion in model container [2019-01-14 18:22:11,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:11" (1/1) ... [2019-01-14 18:22:11,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:22:12,034 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:22:12,447 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:12,458 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:22:12,505 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:12,650 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:22:12,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12 WrapperNode [2019-01-14 18:22:12,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:12,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:22:12,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:22:12,653 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:22:12,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (1/1) ... [2019-01-14 18:22:12,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (1/1) ... [2019-01-14 18:22:12,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (1/1) ... [2019-01-14 18:22:12,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (1/1) ... [2019-01-14 18:22:12,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (1/1) ... [2019-01-14 18:22:12,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (1/1) ... [2019-01-14 18:22:12,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (1/1) ... [2019-01-14 18:22:12,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:22:12,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:22:12,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:22:12,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:22:12,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (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 18:22:12,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:22:12,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:22:12,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:22:12,824 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-14 18:22:12,824 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-14 18:22:12,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:22:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:22:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:22:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:22:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:22:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:22:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:22:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:22:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:22:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:22:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:22:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:22:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:22:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:22:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:22:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:22:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:22:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:22:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:22:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:22:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:22:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:22:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:22:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:22:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:22:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:22:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:22:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:22:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:22:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:22:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:22:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:22:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:22:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:22:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:22:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:22:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:22:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:22:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:22:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:22:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:22:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:22:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:22:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:22:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:22:12,839 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:22:12,840 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:22:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:22:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-14 18:22:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:22:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:22:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-14 18:22:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:22:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:22:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:22:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:22:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:22:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:22:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:22:13,489 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:22:13,490 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-14 18:22:13,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:13 BoogieIcfgContainer [2019-01-14 18:22:13,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:22:13,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:22:13,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:22:13,496 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:22:13,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:22:11" (1/3) ... [2019-01-14 18:22:13,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c834b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:13, skipping insertion in model container [2019-01-14 18:22:13,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:12" (2/3) ... [2019-01-14 18:22:13,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c834b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:13, skipping insertion in model container [2019-01-14 18:22:13,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:13" (3/3) ... [2019-01-14 18:22:13,500 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2019-01-14 18:22:13,512 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:22:13,520 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-01-14 18:22:13,537 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-01-14 18:22:13,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:22:13,565 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:22:13,565 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:22:13,565 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:22:13,566 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:22:13,566 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:22:13,566 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:22:13,566 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:22:13,566 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:22:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-01-14 18:22:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:13,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:13,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:13,598 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1940344200, now seen corresponding path program 1 times [2019-01-14 18:22:13,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:13,610 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 18:22:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:13,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:13,783 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 18:22:13,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:13,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:13,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 18:22:13,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:14,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 18:22:14,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:14,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:14,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-01-14 18:22:14,095 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 18:22:14,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:14,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:14,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:14,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:14,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:14,120 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2019-01-14 18:22:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:14,675 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-14 18:22:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:14,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:14,693 INFO L225 Difference]: With dead ends: 52 [2019-01-14 18:22:14,694 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 18:22:14,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 18:22:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-14 18:22:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 18:22:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-14 18:22:14,745 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-01-14 18:22:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:14,745 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-14 18:22:14,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-14 18:22:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:14,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:14,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:14,748 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:14,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1940344199, now seen corresponding path program 1 times [2019-01-14 18:22:14,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:14,749 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 18:22:14,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:14,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:14,863 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 18:22:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:14,934 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 18:22:14,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:15,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:15,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 18:22:15,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:15,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:15,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:22:15,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:15,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:15,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:15,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 18:22:15,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:15,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:15,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2019-01-14 18:22:15,376 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 18:22:15,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:15,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:15,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:15,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:15,383 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-01-14 18:22:15,602 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 18:22:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:15,894 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-14 18:22:15,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:15,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:15,897 INFO L225 Difference]: With dead ends: 48 [2019-01-14 18:22:15,897 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 18:22:15,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 18:22:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-14 18:22:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 18:22:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-14 18:22:15,905 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-01-14 18:22:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:15,905 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-14 18:22:15,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-14 18:22:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:22:15,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:15,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:15,906 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash -654970086, now seen corresponding path program 1 times [2019-01-14 18:22:15,907 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:15,908 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 18:22:15,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:15,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:16,016 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 18:22:16,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:16,041 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 18:22:16,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:16,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:16,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 18:22:16,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:22:16,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:16,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:22:16,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:16,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:16,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-14 18:22:16,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:22:16,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:16,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:16,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 40 [2019-01-14 18:22:16,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:22:16,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 18:22:16,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:34 [2019-01-14 18:22:16,575 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 18:22:16,576 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:16,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:16,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:16,580 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 7 states. [2019-01-14 18:22:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:17,143 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-14 18:22:17,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:22:17,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-14 18:22:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:17,147 INFO L225 Difference]: With dead ends: 47 [2019-01-14 18:22:17,147 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 18:22:17,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 18:22:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-14 18:22:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 18:22:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-14 18:22:17,155 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-01-14 18:22:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:17,155 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-14 18:22:17,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-14 18:22:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:22:17,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:17,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:17,157 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1277130498, now seen corresponding path program 1 times [2019-01-14 18:22:17,158 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:17,158 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 18:22:17,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:17,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:17,244 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 5 treesize of output 1 [2019-01-14 18:22:17,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:17,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:17,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-01-14 18:22:17,358 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 18:22:17,358 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:17,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:17,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:17,363 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2019-01-14 18:22:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:17,700 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-14 18:22:17,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:17,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-14 18:22:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:17,703 INFO L225 Difference]: With dead ends: 51 [2019-01-14 18:22:17,703 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 18:22:17,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 18:22:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-01-14 18:22:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:22:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-14 18:22:17,711 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2019-01-14 18:22:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:17,712 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-14 18:22:17,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-14 18:22:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:22:17,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:17,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:17,713 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:17,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1277130499, now seen corresponding path program 1 times [2019-01-14 18:22:17,714 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:17,714 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 18:22:17,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:17,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:17,920 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 18:22:17,921 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:17,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:17,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:22:17,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:22:17,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:22:17,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:17,924 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2019-01-14 18:22:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:18,292 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-14 18:22:18,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:18,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-14 18:22:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:18,295 INFO L225 Difference]: With dead ends: 41 [2019-01-14 18:22:18,295 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:22:18,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:22:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 18:22:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:22:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-14 18:22:18,301 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2019-01-14 18:22:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:18,301 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-14 18:22:18,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:22:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-14 18:22:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 18:22:18,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:18,302 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 18:22:18,303 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2092957953, now seen corresponding path program 1 times [2019-01-14 18:22:18,304 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:18,304 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 18:22:18,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:18,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:18,460 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 18:22:18,465 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 18:22:18,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:18,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:18,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:18,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-14 18:22:18,566 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 18:22:18,585 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 18:22:18,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:18,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:18,591 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 18:22:18,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 18:22:18,647 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 18:22:18,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:18,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:18,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 18:22:18,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 18:22:18,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 18:22:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:22:18,657 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2019-01-14 18:22:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:19,240 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-14 18:22:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:22:19,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-14 18:22:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:19,244 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:22:19,245 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 18:22:19,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:22:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 18:22:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-14 18:22:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:22:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-14 18:22:19,250 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 21 [2019-01-14 18:22:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:19,250 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-14 18:22:19,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 18:22:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-14 18:22:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:22:19,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:19,251 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, 1] [2019-01-14 18:22:19,251 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash -457187034, now seen corresponding path program 1 times [2019-01-14 18:22:19,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:19,252 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 18:22:19,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:19,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:19,426 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 18:22:19,431 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 18:22:19,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:19,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:19,447 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 18:22:19,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-14 18:22:19,633 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 22 treesize of output 16 [2019-01-14 18:22:19,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2019-01-14 18:22:19,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:19,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:19,645 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 18:22:19,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-14 18:22:19,877 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 18:22:19,878 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:19,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:19,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-14 18:22:19,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 18:22:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 18:22:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:22:19,884 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 14 states. [2019-01-14 18:22:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:21,353 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-14 18:22:21,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 18:22:21,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-01-14 18:22:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:21,357 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:22:21,357 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:22:21,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-01-14 18:22:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:22:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-14 18:22:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 18:22:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-14 18:22:21,362 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2019-01-14 18:22:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:21,364 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-14 18:22:21,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 18:22:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-14 18:22:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:22:21,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:21,365 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, 1, 1] [2019-01-14 18:22:21,366 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1287896095, now seen corresponding path program 1 times [2019-01-14 18:22:21,366 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:21,366 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 18:22:21,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:21,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:21,524 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 14 treesize of output 11 [2019-01-14 18:22:21,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:21,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:21,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:17 [2019-01-14 18:22:21,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 18:22:21,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 18:22:21,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:21,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:21,633 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 18:22:21,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-14 18:22:21,736 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 18:22:21,741 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 7 [2019-01-14 18:22:21,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:21,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:21,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:21,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-01-14 18:22:21,814 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 18:22:21,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:21,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:21,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 18:22:21,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 18:22:21,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 18:22:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:22:21,817 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 13 states. [2019-01-14 18:22:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:22,546 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-14 18:22:22,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:22:22,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-14 18:22:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:22,549 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:22:22,549 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:22:22,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-01-14 18:22:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:22:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-14 18:22:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 18:22:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-14 18:22:22,555 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2019-01-14 18:22:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:22,555 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-14 18:22:22,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 18:22:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-14 18:22:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:22:22,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:22,558 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, 1, 1, 1, 1, 1] [2019-01-14 18:22:22,558 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:22:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash -814332065, now seen corresponding path program 1 times [2019-01-14 18:22:22,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:22,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 18:22:22,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:22:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:22:22,862 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:22:22,887 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:22:22,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:22:22 BoogieIcfgContainer [2019-01-14 18:22:22,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:22:22,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:22:22,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:22:22,914 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:22:22,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:13" (3/4) ... [2019-01-14 18:22:22,930 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:22:22,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:22:22,933 INFO L168 Benchmark]: Toolchain (without parser) took 10973.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 944.6 MB in the beginning and 1.0 GB in the end (delta: -60.2 MB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:22,935 INFO L168 Benchmark]: CDTParser took 0.18 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 18:22:22,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:22,937 INFO L168 Benchmark]: Boogie Preprocessor took 106.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:22,937 INFO L168 Benchmark]: RCFGBuilder took 731.30 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: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:22,943 INFO L168 Benchmark]: TraceAbstraction took 9420.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.5 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:22,944 INFO L168 Benchmark]: Witness Printer took 18.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:22:22,950 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.18 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 691.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 731.30 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: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9420.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.5 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * Witness Printer took 18.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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: 639]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 639. Possible FailurePath: [L640] TData data; VAL [data={-2147219453:0}] [L641] CALL alloc_data(&data) VAL [pdata={-2147219453:0}] [L625] pdata->lo = malloc(16) VAL [malloc(16)={2:0}, pdata={-2147219453:0}, pdata={-2147219453:0}] [L626] pdata->hi = malloc(24) VAL [malloc(16)={2:0}, malloc(24)={1:0}, pdata={-2147219453:0}, pdata={-2147219453:0}] [L641] RET alloc_data(&data) VAL [data={-2147219453:0}] [L642] CALL free_data(&data) VAL [data={-2147219453:0}] [L630] EXPR data->lo VAL [data={-2147219453:0}, data={-2147219453:0}, data->lo={2:0}] [L630] void *lo = data->lo; [L631] EXPR data->hi VAL [data={-2147219453:0}, data={-2147219453:0}, data->hi={1:0}, lo={2:0}] [L631] void *hi = data->hi; [L632] COND FALSE !(lo == hi) VAL [data={-2147219453:0}, data={-2147219453:0}, hi={1:0}, lo={2:0}] [L636] data->lo = (void *) 0 VAL [data={-2147219453:0}, data={-2147219453:0}, hi={1:0}, lo={2:0}] [L637] data->hi = (void *) 0 VAL [data={-2147219453:0}, data={-2147219453:0}, hi={1:0}, lo={2:0}] [L642] RET free_data(&data) VAL [data={-2147219453:0}] [L643] return 0; [L643] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 19 error locations. UNSAFE Result, 9.3s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 253 SDslu, 814 SDs, 0 SdLazy, 995 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 119 ConstructedInterpolants, 5 QuantifiedInterpolants, 13640 SizeOfPredicates, 54 NumberOfNonLiveVariables, 628 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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...