./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/test-0019_true-valid-memsafety_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_true-valid-memsafety_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 cb3a1029b311511a929aa1b20bb93012329001e7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:23:07,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:23:07,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:23:07,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:23:07,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:23:07,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:23:07,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:23:07,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:23:07,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:23:07,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:23:07,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:23:07,052 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:23:07,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:23:07,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:23:07,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:23:07,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:23:07,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:23:07,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:23:07,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:23:07,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:23:07,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:23:07,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:23:07,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:23:07,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:23:07,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:23:07,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:23:07,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:23:07,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:23:07,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:23:07,079 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:23:07,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:23:07,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:23:07,081 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:23:07,081 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:23:07,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:23:07,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:23:07,084 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:23:07,099 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:23:07,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:23:07,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:23:07,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:23:07,101 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:23:07,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:23:07,102 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:23:07,102 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:23:07,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:23:07,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:23:07,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:23:07,103 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:23:07,103 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:23:07,103 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:23:07,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:23:07,103 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:23:07,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:23:07,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:23:07,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:23:07,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:23:07,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:23:07,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:23:07,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:23:07,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:23:07,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:23:07,106 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 -> cb3a1029b311511a929aa1b20bb93012329001e7 [2019-01-14 18:23:07,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:23:07,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:23:07,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:23:07,188 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:23:07,189 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:23:07,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2019-01-14 18:23:07,256 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018060d6b/f5ea1400b74a43b7988967e2f03f5763/FLAG873fea127 [2019-01-14 18:23:07,728 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:23:07,728 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2019-01-14 18:23:07,740 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018060d6b/f5ea1400b74a43b7988967e2f03f5763/FLAG873fea127 [2019-01-14 18:23:08,054 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018060d6b/f5ea1400b74a43b7988967e2f03f5763 [2019-01-14 18:23:08,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:23:08,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:23:08,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:23:08,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:23:08,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:23:08,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@872c042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08, skipping insertion in model container [2019-01-14 18:23:08,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:23:08,129 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:23:08,497 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:23:08,509 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:23:08,566 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:23:08,706 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:23:08,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08 WrapperNode [2019-01-14 18:23:08,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:23:08,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:23:08,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:23:08,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:23:08,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (1/1) ... [2019-01-14 18:23:08,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:23:08,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:23:08,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:23:08,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:23:08,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (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:23:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:23:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:23:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-14 18:23:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-14 18:23:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:23:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:23:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:23:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:23:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:23:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:23:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:23:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:23:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:23:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:23:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:23:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:23:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:23:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:23:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:23:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:23:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:23:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:23:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:23:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:23:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:23:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:23:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:23:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:23:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:23:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:23:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:23:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:23:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:23:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:23:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:23:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:23:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:23:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:23:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:23:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:23:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:23:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:23:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:23:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:23:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:23:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:23:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:23:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:23:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:23:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:23:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:23:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:23:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:23:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:23:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:23:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:23:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:23:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:23:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:23:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:23:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:23:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:23:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:23:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:23:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:23:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:23:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:23:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:23:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:23:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:23:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:23:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:23:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:23:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:23:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:23:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:23:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:23:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:23:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:23:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:23:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:23:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:23:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:23:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:23:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:23:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:23:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:23:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:23:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:23:09,530 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:23:09,530 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-14 18:23:09,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:23:09 BoogieIcfgContainer [2019-01-14 18:23:09,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:23:09,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:23:09,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:23:09,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:23:09,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:23:08" (1/3) ... [2019-01-14 18:23:09,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c49f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:23:09, skipping insertion in model container [2019-01-14 18:23:09,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:23:08" (2/3) ... [2019-01-14 18:23:09,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c49f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:23:09, skipping insertion in model container [2019-01-14 18:23:09,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:23:09" (3/3) ... [2019-01-14 18:23:09,539 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2019-01-14 18:23:09,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:23:09,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-01-14 18:23:09,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-01-14 18:23:09,599 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:23:09,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:23:09,600 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:23:09,600 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:23:09,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:23:09,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:23:09,601 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:23:09,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:23:09,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:23:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-01-14 18:23:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:23:09,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:09,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:09,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2134146503, now seen corresponding path program 1 times [2019-01-14 18:23:09,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:09,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:09,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:09,916 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:23:09,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:09,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:23:09,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:23:09,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:23:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:23:09,940 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 5 states. [2019-01-14 18:23:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:10,365 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-14 18:23:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:23:10,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:23:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:10,377 INFO L225 Difference]: With dead ends: 56 [2019-01-14 18:23:10,377 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 18:23:10,379 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:23:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 18:23:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-14 18:23:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 18:23:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-14 18:23:10,416 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 9 [2019-01-14 18:23:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:10,416 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-14 18:23:10,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:23:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-14 18:23:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:23:10,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:10,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:10,418 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:10,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2134146502, now seen corresponding path program 1 times [2019-01-14 18:23:10,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:10,555 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:23:10,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:10,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:23:10,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:23:10,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:23:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:23:10,558 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 5 states. [2019-01-14 18:23:10,825 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 18:23:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:11,080 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-14 18:23:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:23:11,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:23:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:11,085 INFO L225 Difference]: With dead ends: 50 [2019-01-14 18:23:11,086 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 18:23:11,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:23:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 18:23:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-14 18:23:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 18:23:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-14 18:23:11,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 9 [2019-01-14 18:23:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:11,094 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-14 18:23:11,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:23:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-14 18:23:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:23:11,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:11,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:11,095 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2079577723, now seen corresponding path program 1 times [2019-01-14 18:23:11,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:11,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:11,283 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:23:11,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:11,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:23:11,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:23:11,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:23:11,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:23:11,285 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 6 states. [2019-01-14 18:23:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:11,465 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-14 18:23:11,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:23:11,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-14 18:23:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:11,470 INFO L225 Difference]: With dead ends: 49 [2019-01-14 18:23:11,470 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 18:23:11,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:23:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 18:23:11,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-14 18:23:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 18:23:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-14 18:23:11,477 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2019-01-14 18:23:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:11,478 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-14 18:23:11,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:23:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-14 18:23:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:23:11,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:11,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:11,480 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 38868061, now seen corresponding path program 1 times [2019-01-14 18:23:11,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:11,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:11,542 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:23:11,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:11,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:23:11,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:23:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:23:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:23:11,545 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 3 states. [2019-01-14 18:23:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:11,625 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-14 18:23:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:23:11,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 18:23:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:11,627 INFO L225 Difference]: With dead ends: 45 [2019-01-14 18:23:11,627 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 18:23:11,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:23:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 18:23:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 18:23:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:23:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-14 18:23:11,632 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 18 [2019-01-14 18:23:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:11,632 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-14 18:23:11,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:23:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-14 18:23:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:23:11,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:11,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:11,634 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash 38868062, now seen corresponding path program 1 times [2019-01-14 18:23:11,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:11,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:11,699 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:23:11,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:11,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:23:11,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:23:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:23:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:23:11,700 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 3 states. [2019-01-14 18:23:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:11,752 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-14 18:23:11,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:23:11,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 18:23:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:11,754 INFO L225 Difference]: With dead ends: 41 [2019-01-14 18:23:11,754 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:23:11,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:23:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:23:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 18:23:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:23:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-14 18:23:11,761 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2019-01-14 18:23:11,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:11,762 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-14 18:23:11,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:23:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-14 18:23:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:23:11,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:11,763 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:23:11,763 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1504232730, now seen corresponding path program 1 times [2019-01-14 18:23:11,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:12,036 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:23:12,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:12,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:23:12,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:23:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:23:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:23:12,039 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 11 states. [2019-01-14 18:23:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:12,295 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-14 18:23:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:23:12,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-01-14 18:23:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:12,296 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:23:12,297 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:23:12,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:23:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:23:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 18:23:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:23:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-14 18:23:12,302 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2019-01-14 18:23:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:12,302 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-14 18:23:12,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:23:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-14 18:23:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:23:12,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:12,304 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:23:12,304 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash 613425701, now seen corresponding path program 1 times [2019-01-14 18:23:12,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:12,587 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:23:12,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:12,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:23:12,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:23:12,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:23:12,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:23:12,589 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2019-01-14 18:23:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:12,925 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-14 18:23:12,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:23:12,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-14 18:23:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:12,929 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:23:12,929 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:23:12,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:23:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:23:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-14 18:23:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:23:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-14 18:23:12,934 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2019-01-14 18:23:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:12,934 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-14 18:23:12,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:23:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-14 18:23:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:23:12,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:12,935 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, 1] [2019-01-14 18:23:12,936 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1836327624, now seen corresponding path program 1 times [2019-01-14 18:23:12,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:12,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:12,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:13,393 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:23:13,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:13,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 18:23:13,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 18:23:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 18:23:13,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:23:13,395 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2019-01-14 18:23:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:13,879 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-14 18:23:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:23:13,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-14 18:23:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:13,881 INFO L225 Difference]: With dead ends: 38 [2019-01-14 18:23:13,882 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 18:23:13,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:23:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 18:23:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 18:23:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 18:23:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-14 18:23:13,885 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 27 [2019-01-14 18:23:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:13,886 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-14 18:23:13,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 18:23:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-14 18:23:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:23:13,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:13,887 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, 1, 1] [2019-01-14 18:23:13,887 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1090999980, now seen corresponding path program 1 times [2019-01-14 18:23:13,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:13,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:13,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:14,312 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-14 18:23:14,606 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-14 18:23:14,867 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:23:14,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:14,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-14 18:23:14,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:23:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:23:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:23:14,869 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 17 states. [2019-01-14 18:23:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:15,783 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2019-01-14 18:23:15,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 18:23:15,784 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-01-14 18:23:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:15,785 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:23:15,785 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 18:23:15,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-01-14 18:23:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 18:23:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 18:23:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 18:23:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2019-01-14 18:23:15,790 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 28 [2019-01-14 18:23:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:15,790 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2019-01-14 18:23:15,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:23:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2019-01-14 18:23:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:23:15,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:15,792 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, 1, 1] [2019-01-14 18:23:15,792 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1091581575, now seen corresponding path program 1 times [2019-01-14 18:23:15,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:15,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:16,184 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:23:16,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:16,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 18:23:16,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 18:23:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 18:23:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:23:16,185 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 12 states. [2019-01-14 18:23:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:16,424 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2019-01-14 18:23:16,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:23:16,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-01-14 18:23:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:16,425 INFO L225 Difference]: With dead ends: 37 [2019-01-14 18:23:16,425 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 18:23:16,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:23:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 18:23:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-14 18:23:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 18:23:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2019-01-14 18:23:16,429 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 28 [2019-01-14 18:23:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:16,429 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2019-01-14 18:23:16,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 18:23:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2019-01-14 18:23:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:23:16,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:16,430 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, 1, 1, 1] [2019-01-14 18:23:16,431 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:16,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:16,431 INFO L82 PathProgramCache]: Analyzing trace with hash -520709462, now seen corresponding path program 1 times [2019-01-14 18:23:16,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:16,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:16,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:16,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:16,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:16,692 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:23:16,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:16,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 18:23:16,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 18:23:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 18:23:16,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:23:16,694 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 12 states. [2019-01-14 18:23:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:16,997 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-01-14 18:23:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:23:16,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-01-14 18:23:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:17,001 INFO L225 Difference]: With dead ends: 36 [2019-01-14 18:23:17,001 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 18:23:17,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:23:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 18:23:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-14 18:23:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 18:23:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2019-01-14 18:23:17,005 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 29 [2019-01-14 18:23:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:17,005 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2019-01-14 18:23:17,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 18:23:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2019-01-14 18:23:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:23:17,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:17,006 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, 1, 1, 1, 1] [2019-01-14 18:23:17,007 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1037875945, now seen corresponding path program 1 times [2019-01-14 18:23:17,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:17,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:17,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:17,801 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:23:17,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:17,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-14 18:23:17,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 18:23:17,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 18:23:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-01-14 18:23:17,804 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 21 states. [2019-01-14 18:23:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:19,008 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2019-01-14 18:23:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 18:23:19,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-01-14 18:23:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:19,010 INFO L225 Difference]: With dead ends: 35 [2019-01-14 18:23:19,010 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 18:23:19,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 18:23:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 18:23:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-14 18:23:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 18:23:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2019-01-14 18:23:19,014 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 30 [2019-01-14 18:23:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:19,014 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2019-01-14 18:23:19,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 18:23:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2019-01-14 18:23:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:23:19,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:19,015 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:19,016 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 18:23:19,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash 971679827, now seen corresponding path program 1 times [2019-01-14 18:23:19,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:23:19,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:23:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:19,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:23:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:19,603 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-14 18:23:19,912 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-01-14 18:23:20,413 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-14 18:23:20,611 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-01-14 18:23:21,662 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-14 18:23:22,064 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:23:22,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:22,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-14 18:23:22,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 18:23:22,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 18:23:22,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2019-01-14 18:23:22,065 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 23 states. [2019-01-14 18:23:23,365 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-14 18:23:23,624 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-01-14 18:23:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:23,961 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2019-01-14 18:23:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 18:23:23,962 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2019-01-14 18:23:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:23,963 INFO L225 Difference]: With dead ends: 34 [2019-01-14 18:23:23,963 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:23:23,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 18:23:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:23:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:23:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:23:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:23:23,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-01-14 18:23:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:23,965 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:23:23,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 18:23:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:23:23,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:23:23,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:23:23 BoogieIcfgContainer [2019-01-14 18:23:23,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:23:23,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:23:23,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:23:23,971 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:23:23,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:23:09" (3/4) ... [2019-01-14 18:23:23,975 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:23:23,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:23:23,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-01-14 18:23:23,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:23:23,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-01-14 18:23:23,986 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-14 18:23:23,987 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 18:23:23,987 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 18:23:24,035 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:23:24,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:23:24,036 INFO L168 Benchmark]: Toolchain (without parser) took 15978.25 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -286.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:24,037 INFO L168 Benchmark]: CDTParser took 0.22 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:23:24,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:24,038 INFO L168 Benchmark]: Boogie Preprocessor took 53.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:24,039 INFO L168 Benchmark]: RCFGBuilder took 770.70 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:24,039 INFO L168 Benchmark]: TraceAbstraction took 14438.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -166.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:24,040 INFO L168 Benchmark]: Witness Printer took 64.63 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:24,044 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.22 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 646.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 770.70 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14438.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -166.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Witness Printer took 64.63 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. SAFE Result, 14.3s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 346 SDtfs, 372 SDslu, 1242 SDs, 0 SdLazy, 2181 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 88102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...