./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.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 ab87ef7cc863b18816ae397a50b6c6e9fb3e753d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:09:57,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:09:57,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:09:57,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:09:57,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:09:57,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:09:57,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:09:57,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:09:57,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:09:57,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:09:57,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:09:57,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:09:57,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:09:57,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:09:57,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:09:57,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:09:57,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:09:57,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:09:57,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:09:57,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:09:57,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:09:57,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:09:57,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:09:57,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:09:57,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:09:57,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:09:57,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:09:57,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:09:57,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:09:57,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:09:57,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:09:57,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:09:57,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:09:57,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:09:57,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:09:57,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:09:57,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:09:57,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:09:57,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:09:57,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:09:57,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:09:57,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:09:57,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:09:57,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:09:57,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:09:57,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:09:57,795 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:09:57,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:09:57,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:09:57,796 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:09:57,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:09:57,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:09:57,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:09:57,798 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:09:57,798 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:09:57,799 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:09:57,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:09:57,801 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:09:57,801 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:09:57,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:09:57,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:09:57,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:09:57,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:09:57,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:09:57,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:09:57,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:09:57,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:09:57,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:09:57,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:09:57,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:09:57,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab87ef7cc863b18816ae397a50b6c6e9fb3e753d [2019-11-28 20:09:58,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:09:58,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:09:58,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:09:58,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:09:58,174 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:09:58,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-11-28 20:09:58,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e19bc7d/69daf291a4be409f94551717ec5cf8b6/FLAGe591f4bd8 [2019-11-28 20:09:58,789 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:09:58,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-11-28 20:09:58,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e19bc7d/69daf291a4be409f94551717ec5cf8b6/FLAGe591f4bd8 [2019-11-28 20:09:59,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e19bc7d/69daf291a4be409f94551717ec5cf8b6 [2019-11-28 20:09:59,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:09:59,073 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:09:59,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:09:59,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:09:59,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:09:59,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbfb8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59, skipping insertion in model container [2019-11-28 20:09:59,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:09:59,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:09:59,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:09:59,688 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:09:59,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:09:59,799 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:09:59,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59 WrapperNode [2019-11-28 20:09:59,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:09:59,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:09:59,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:09:59,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:09:59,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... [2019-11-28 20:09:59,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:09:59,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:09:59,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:09:59,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:09:59,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:09:59,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:09:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:09:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:09:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:09:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:09:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:09:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:09:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure test_fun [2019-11-28 20:09:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:09:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:09:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:09:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:09:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:09:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:09:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:09:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:09:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:09:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:09:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:09:59,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:09:59,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:09:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:09:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:09:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:09:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:09:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:09:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:09:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:09:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:09:59,930 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:09:59,930 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:09:59,930 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:09:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:09:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:09:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:09:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:09:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:09:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:09:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:09:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:09:59,933 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:09:59,933 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:09:59,933 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:09:59,933 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:09:59,933 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:09:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:09:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:09:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:09:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:09:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:09:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:09:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:09:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:09:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:09:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:09:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:09:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:09:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:09:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:09:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:09:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:09:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:09:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:09:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:09:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:09:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:09:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:09:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:09:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:09:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:09:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:09:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:09:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:09:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:09:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:09:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:09:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:09:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:09:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:09:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:09:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:09:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:09:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:09:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:09:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:09:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:09:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:09:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:09:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:09:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:09:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:09:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:09:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:09:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:09:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:09:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:09:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:09:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:09:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:09:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:09:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:09:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:09:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:09:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:09:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:09:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:09:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:09:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:09:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure test_fun [2019-11-28 20:09:59,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:09:59,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:09:59,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:09:59,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:09:59,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:09:59,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:09:59,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:10:00,526 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:10:00,527 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 20:10:00,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:00 BoogieIcfgContainer [2019-11-28 20:10:00,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:10:00,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:10:00,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:10:00,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:10:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:09:59" (1/3) ... [2019-11-28 20:10:00,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743aed5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:00, skipping insertion in model container [2019-11-28 20:10:00,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:09:59" (2/3) ... [2019-11-28 20:10:00,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743aed5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:00, skipping insertion in model container [2019-11-28 20:10:00,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:00" (3/3) ... [2019-11-28 20:10:00,547 INFO L109 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2019-11-28 20:10:00,558 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:10:00,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-28 20:10:00,583 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-28 20:10:00,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:10:00,608 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:10:00,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:10:00,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:10:00,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:10:00,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:10:00,618 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:10:00,618 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:10:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-11-28 20:10:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:10:00,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:00,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:00,655 INFO L410 AbstractCegarLoop]: === Iteration 1 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash 743499951, now seen corresponding path program 1 times [2019-11-28 20:10:00,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:00,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998463695] [2019-11-28 20:10:00,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:00,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998463695] [2019-11-28 20:10:00,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:00,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:00,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117680627] [2019-11-28 20:10:00,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:00,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:00,963 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 4 states. [2019-11-28 20:10:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:01,215 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-11-28 20:10:01,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:01,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 20:10:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:01,231 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:10:01,232 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:10:01,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:10:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 20:10:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 20:10:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 20:10:01,301 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 9 [2019-11-28 20:10:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:01,302 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 20:10:01,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 20:10:01,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:10:01,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:01,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:01,306 INFO L410 AbstractCegarLoop]: === Iteration 2 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:01,306 INFO L82 PathProgramCache]: Analyzing trace with hash 743499952, now seen corresponding path program 1 times [2019-11-28 20:10:01,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:01,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763450376] [2019-11-28 20:10:01,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:01,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763450376] [2019-11-28 20:10:01,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:01,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:01,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634483252] [2019-11-28 20:10:01,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:01,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:01,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:01,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:01,459 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2019-11-28 20:10:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:01,613 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 20:10:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:01,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 20:10:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:01,617 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:10:01,617 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:10:01,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:10:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 20:10:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:10:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-11-28 20:10:01,630 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 9 [2019-11-28 20:10:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:01,631 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-11-28 20:10:01,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-11-28 20:10:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:10:01,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:01,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:01,633 INFO L410 AbstractCegarLoop]: === Iteration 3 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1573661992, now seen corresponding path program 1 times [2019-11-28 20:10:01,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:01,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854396819] [2019-11-28 20:10:01,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:01,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854396819] [2019-11-28 20:10:01,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:01,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:01,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807049529] [2019-11-28 20:10:01,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:01,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:01,776 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 4 states. [2019-11-28 20:10:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:01,915 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-11-28 20:10:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:01,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:10:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:01,917 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:10:01,917 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 20:10:01,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 20:10:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 20:10:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:10:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-11-28 20:10:01,936 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 10 [2019-11-28 20:10:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:01,937 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-11-28 20:10:01,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-11-28 20:10:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:10:01,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:01,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:01,939 INFO L410 AbstractCegarLoop]: === Iteration 4 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1573661993, now seen corresponding path program 1 times [2019-11-28 20:10:01,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:01,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749640709] [2019-11-28 20:10:01,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:02,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749640709] [2019-11-28 20:10:02,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:02,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:02,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139737639] [2019-11-28 20:10:02,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:02,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,062 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 4 states. [2019-11-28 20:10:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:02,178 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-11-28 20:10:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:02,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:10:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:02,180 INFO L225 Difference]: With dead ends: 50 [2019-11-28 20:10:02,181 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 20:10:02,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 20:10:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 20:10:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:10:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 20:10:02,188 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 10 [2019-11-28 20:10:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:02,188 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 20:10:02,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 20:10:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:10:02,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:02,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:02,190 INFO L410 AbstractCegarLoop]: === Iteration 5 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1538881490, now seen corresponding path program 1 times [2019-11-28 20:10:02,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:02,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678440229] [2019-11-28 20:10:02,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:02,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678440229] [2019-11-28 20:10:02,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:02,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:02,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967683076] [2019-11-28 20:10:02,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:02,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:02,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:02,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,253 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 4 states. [2019-11-28 20:10:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:02,369 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-11-28 20:10:02,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:02,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:10:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:02,371 INFO L225 Difference]: With dead ends: 46 [2019-11-28 20:10:02,371 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 20:10:02,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 20:10:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-28 20:10:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 20:10:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-11-28 20:10:02,378 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 11 [2019-11-28 20:10:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:02,378 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-11-28 20:10:02,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-11-28 20:10:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:10:02,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:02,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:02,380 INFO L410 AbstractCegarLoop]: === Iteration 6 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1538881491, now seen corresponding path program 1 times [2019-11-28 20:10:02,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:02,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71494653] [2019-11-28 20:10:02,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:02,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71494653] [2019-11-28 20:10:02,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:02,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:02,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144740504] [2019-11-28 20:10:02,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:02,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:02,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,448 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 4 states. [2019-11-28 20:10:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:02,538 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 20:10:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:02,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:10:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:02,540 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:10:02,540 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:10:02,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:10:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 20:10:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 20:10:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-28 20:10:02,545 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 11 [2019-11-28 20:10:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:02,546 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 20:10:02,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-11-28 20:10:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:10:02,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:02,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:02,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 460685931, now seen corresponding path program 1 times [2019-11-28 20:10:02,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:02,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182446008] [2019-11-28 20:10:02,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:02,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182446008] [2019-11-28 20:10:02,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:02,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:02,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863823163] [2019-11-28 20:10:02,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:02,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:02,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:02,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,598 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2019-11-28 20:10:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:02,676 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-11-28 20:10:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:02,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:10:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:02,679 INFO L225 Difference]: With dead ends: 38 [2019-11-28 20:10:02,679 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 20:10:02,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 20:10:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 20:10:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:10:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 20:10:02,683 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 12 [2019-11-28 20:10:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:02,683 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 20:10:02,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 20:10:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:10:02,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:02,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:02,685 INFO L410 AbstractCegarLoop]: === Iteration 8 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 460685932, now seen corresponding path program 1 times [2019-11-28 20:10:02,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:02,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089906288] [2019-11-28 20:10:02,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:02,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089906288] [2019-11-28 20:10:02,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:02,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:02,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735574752] [2019-11-28 20:10:02,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:02,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:02,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:02,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,743 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2019-11-28 20:10:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:02,816 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-11-28 20:10:02,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:02,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:10:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:02,817 INFO L225 Difference]: With dead ends: 34 [2019-11-28 20:10:02,817 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 20:10:02,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 20:10:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 20:10:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 20:10:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-28 20:10:02,821 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2019-11-28 20:10:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:02,821 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-28 20:10:02,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-28 20:10:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:10:02,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:02,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:02,823 INFO L410 AbstractCegarLoop]: === Iteration 9 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:10:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:02,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1533919015, now seen corresponding path program 1 times [2019-11-28 20:10:02,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:02,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653299333] [2019-11-28 20:10:02,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:03,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653299333] [2019-11-28 20:10:03,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:03,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:10:03,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476339556] [2019-11-28 20:10:03,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:03,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:03,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:03,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:03,085 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 6 states. [2019-11-28 20:10:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:03,221 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 20:10:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:03,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 20:10:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:03,222 INFO L225 Difference]: With dead ends: 33 [2019-11-28 20:10:03,223 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:10:03,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:10:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:10:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:10:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:10:03,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-28 20:10:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:03,224 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:10:03,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:10:03,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:10:03,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:10:03 BoogieIcfgContainer [2019-11-28 20:10:03,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:10:03,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:10:03,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:10:03,234 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:10:03,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:00" (3/4) ... [2019-11-28 20:10:03,239 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:10:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:10:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-28 20:10:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure test_fun [2019-11-28 20:10:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-28 20:10:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-28 20:10:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-28 20:10:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:10:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-28 20:10:03,256 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-28 20:10:03,256 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-28 20:10:03,256 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:10:03,257 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:10:03,309 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:10:03,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:10:03,312 INFO L168 Benchmark]: Toolchain (without parser) took 4239.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 963.0 MB in the beginning and 822.5 MB in the end (delta: 140.5 MB). Peak memory consumption was 270.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:03,313 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:10:03,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:03,314 INFO L168 Benchmark]: Boogie Preprocessor took 56.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:03,315 INFO L168 Benchmark]: RCFGBuilder took 671.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:03,315 INFO L168 Benchmark]: TraceAbstraction took 2700.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 822.5 MB in the end (delta: 229.3 MB). Peak memory consumption was 229.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:03,316 INFO L168 Benchmark]: Witness Printer took 75.93 ms. Allocated memory is still 1.2 GB. Free memory is still 822.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:10:03,319 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 726.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 671.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2700.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 822.5 MB in the end (delta: 229.3 MB). Peak memory consumption was 229.3 MB. Max. memory is 11.5 GB. * Witness Printer took 75.93 ms. Allocated memory is still 1.2 GB. Free memory is still 822.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 82 locations, 31 error locations. Result: SAFE, OverallTime: 2.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 202 SDtfs, 301 SDslu, 95 SDs, 0 SdLazy, 660 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 10636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...