./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c9c8a757 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/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-c9c8a75 [2019-11-28 10:20:38,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:20:38,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:20:38,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:20:38,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:20:38,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:20:38,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:20:38,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:20:38,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:20:38,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:20:38,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:20:38,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:20:38,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:20:38,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:20:38,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:20:38,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:20:38,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:20:38,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:20:38,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:20:38,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:20:38,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:20:38,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:20:38,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:20:38,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:20:38,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:20:38,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:20:38,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:20:38,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:20:38,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:20:38,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:20:38,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:20:38,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:20:38,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:20:38,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:20:38,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:20:38,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:20:38,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:20:38,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:20:38,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:20:38,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:20:38,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:20:38,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 10:20:38,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:20:38,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:20:38,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:20:38,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:20:38,959 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:20:38,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:20:38,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:20:38,960 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:20:38,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:20:38,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:20:38,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:20:38,961 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:20:38,961 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:20:38,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:20:38,961 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:20:38,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:20:38,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:20:38,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:20:38,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:20:38,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:20:38,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:20:38,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:20:38,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:20:38,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:20:38,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:20:38,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:20:38,964 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-memcleanup) ) 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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-28 10:20:39,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:20:39,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:20:39,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:20:39,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:20:39,331 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:20:39,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-28 10:20:39,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10bc3c24/35b1cfd5919b4e2387ea2d0d5c6be6f0/FLAGcec020e60 [2019-11-28 10:20:39,934 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:20:39,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-28 10:20:39,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10bc3c24/35b1cfd5919b4e2387ea2d0d5c6be6f0/FLAGcec020e60 [2019-11-28 10:20:40,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10bc3c24/35b1cfd5919b4e2387ea2d0d5c6be6f0 [2019-11-28 10:20:40,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:20:40,306 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:20:40,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:20:40,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:20:40,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:20:40,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19255d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40, skipping insertion in model container [2019-11-28 10:20:40,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:20:40,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:20:40,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:20:40,789 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:20:40,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:20:40,897 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:20:40,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40 WrapperNode [2019-11-28 10:20:40,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:20:40,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:20:40,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:20:40,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:20:40,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... [2019-11-28 10:20:40,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:20:40,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:20:40,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:20:40,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:20:40,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:20:41,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:20:41,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:20:41,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 10:20:41,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 10:20:41,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 10:20:41,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 10:20:41,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 10:20:41,059 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 10:20:41,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:20:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 10:20:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:20:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 10:20:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 10:20:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 10:20:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 10:20:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 10:20:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 10:20:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 10:20:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 10:20:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 10:20:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 10:20:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 10:20:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 10:20:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 10:20:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 10:20:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 10:20:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 10:20:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 10:20:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 10:20:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 10:20:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 10:20:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 10:20:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 10:20:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 10:20:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 10:20:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 10:20:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 10:20:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 10:20:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 10:20:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 10:20:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 10:20:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 10:20:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 10:20:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 10:20:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 10:20:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 10:20:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 10:20:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 10:20:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 10:20:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 10:20:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 10:20:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 10:20:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 10:20:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 10:20:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 10:20:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 10:20:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 10:20:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 10:20:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 10:20:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 10:20:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 10:20:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 10:20:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 10:20:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 10:20:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 10:20:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 10:20:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 10:20:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 10:20:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 10:20:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 10:20:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 10:20:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 10:20:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 10:20:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 10:20:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 10:20:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 10:20:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 10:20:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:20:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 10:20:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 10:20:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 10:20:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 10:20:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 10:20:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 10:20:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:20:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:20:41,417 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 10:20:41,735 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:20:41,736 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 10:20:41,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:20:41 BoogieIcfgContainer [2019-11-28 10:20:41,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:20:41,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:20:41,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:20:41,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:20:41,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:20:40" (1/3) ... [2019-11-28 10:20:41,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5234161a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:20:41, skipping insertion in model container [2019-11-28 10:20:41,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:40" (2/3) ... [2019-11-28 10:20:41,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5234161a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:20:41, skipping insertion in model container [2019-11-28 10:20:41,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:20:41" (3/3) ... [2019-11-28 10:20:41,752 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-28 10:20:41,763 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:20:41,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-11-28 10:20:41,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-11-28 10:20:41,817 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:20:41,820 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:20:41,820 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:20:41,821 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:20:41,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:20:41,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:20:41,825 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:20:41,825 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:20:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-11-28 10:20:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 10:20:41,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:41,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:41,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:41,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 783594837, now seen corresponding path program 1 times [2019-11-28 10:20:41,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:41,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107982386] [2019-11-28 10:20:41,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:42,069 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 10:20:42,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107982386] [2019-11-28 10:20:42,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:42,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:20:42,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202253708] [2019-11-28 10:20:42,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:20:42,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:42,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:20:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:20:42,099 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-11-28 10:20:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:42,317 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-11-28 10:20:42,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:20:42,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 10:20:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:42,329 INFO L225 Difference]: With dead ends: 81 [2019-11-28 10:20:42,330 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 10:20:42,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:20:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 10:20:42,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 10:20:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 10:20:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-11-28 10:20:42,377 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 10 [2019-11-28 10:20:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:42,378 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-11-28 10:20:42,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:20:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-11-28 10:20:42,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 10:20:42,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:42,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:42,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1478399476, now seen corresponding path program 1 times [2019-11-28 10:20:42,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:42,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892725621] [2019-11-28 10:20:42,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:42,509 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 10:20:42,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892725621] [2019-11-28 10:20:42,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:42,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 10:20:42,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76225918] [2019-11-28 10:20:42,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:20:42,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:42,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:20:42,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:20:42,518 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2019-11-28 10:20:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:42,779 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-28 10:20:42,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:20:42,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 10:20:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:42,781 INFO L225 Difference]: With dead ends: 95 [2019-11-28 10:20:42,781 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 10:20:42,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:20:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 10:20:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2019-11-28 10:20:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 10:20:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-11-28 10:20:42,793 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 11 [2019-11-28 10:20:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:42,794 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-11-28 10:20:42,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:20:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-11-28 10:20:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 10:20:42,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:42,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:42,795 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1478399475, now seen corresponding path program 1 times [2019-11-28 10:20:42,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:42,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258222490] [2019-11-28 10:20:42,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:42,937 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 10:20:42,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258222490] [2019-11-28 10:20:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:42,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 10:20:42,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602329681] [2019-11-28 10:20:42,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:20:42,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:20:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:20:42,941 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 5 states. [2019-11-28 10:20:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:43,271 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-11-28 10:20:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:20:43,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 10:20:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:43,273 INFO L225 Difference]: With dead ends: 103 [2019-11-28 10:20:43,273 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 10:20:43,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:20:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 10:20:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2019-11-28 10:20:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 10:20:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-28 10:20:43,295 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 11 [2019-11-28 10:20:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:43,296 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-28 10:20:43,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:20:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-11-28 10:20:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 10:20:43,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:43,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:43,298 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:43,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:43,299 INFO L82 PathProgramCache]: Analyzing trace with hash -203522987, now seen corresponding path program 1 times [2019-11-28 10:20:43,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:43,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698804468] [2019-11-28 10:20:43,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:20:43,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698804468] [2019-11-28 10:20:43,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:43,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 10:20:43,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913560787] [2019-11-28 10:20:43,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:20:43,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:20:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:20:43,448 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 7 states. [2019-11-28 10:20:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:43,830 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2019-11-28 10:20:43,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:20:43,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 10:20:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:43,832 INFO L225 Difference]: With dead ends: 136 [2019-11-28 10:20:43,832 INFO L226 Difference]: Without dead ends: 136 [2019-11-28 10:20:43,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-28 10:20:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 94. [2019-11-28 10:20:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 10:20:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-11-28 10:20:43,844 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 18 [2019-11-28 10:20:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:43,844 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-11-28 10:20:43,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:20:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-11-28 10:20:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 10:20:43,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:43,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:43,846 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2045615242, now seen corresponding path program 1 times [2019-11-28 10:20:43,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:43,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384088336] [2019-11-28 10:20:43,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:43,951 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 10:20:43,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384088336] [2019-11-28 10:20:43,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:43,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 10:20:43,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877994373] [2019-11-28 10:20:43,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:20:43,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:43,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:20:43,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:20:43,954 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 5 states. [2019-11-28 10:20:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:44,197 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-28 10:20:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:20:44,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 10:20:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:44,199 INFO L225 Difference]: With dead ends: 101 [2019-11-28 10:20:44,199 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 10:20:44,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:20:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 10:20:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2019-11-28 10:20:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 10:20:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-28 10:20:44,207 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 19 [2019-11-28 10:20:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:44,207 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-28 10:20:44,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:20:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-28 10:20:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 10:20:44,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:44,209 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] [2019-11-28 10:20:44,209 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1010482820, now seen corresponding path program 1 times [2019-11-28 10:20:44,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:44,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356457887] [2019-11-28 10:20:44,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:44,286 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 10:20:44,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356457887] [2019-11-28 10:20:44,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:44,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 10:20:44,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747018391] [2019-11-28 10:20:44,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:20:44,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:20:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:20:44,288 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2019-11-28 10:20:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:44,514 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-11-28 10:20:44,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:20:44,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 10:20:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:44,516 INFO L225 Difference]: With dead ends: 105 [2019-11-28 10:20:44,516 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 10:20:44,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 10:20:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-28 10:20:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 10:20:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-28 10:20:44,526 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 20 [2019-11-28 10:20:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:44,526 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-28 10:20:44,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:20:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-28 10:20:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 10:20:44,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:44,527 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 10:20:44,528 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1258779451, now seen corresponding path program 1 times [2019-11-28 10:20:44,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:44,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489802323] [2019-11-28 10:20:44,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:44,612 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 10:20:44,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489802323] [2019-11-28 10:20:44,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:44,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 10:20:44,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146489354] [2019-11-28 10:20:44,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:20:44,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:44,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:20:44,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:20:44,615 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 6 states. [2019-11-28 10:20:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:44,792 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-11-28 10:20:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:20:44,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 10:20:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:44,795 INFO L225 Difference]: With dead ends: 111 [2019-11-28 10:20:44,795 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 10:20:44,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:20:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 10:20:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-28 10:20:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 10:20:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-28 10:20:44,803 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 21 [2019-11-28 10:20:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:44,803 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-28 10:20:44,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:20:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-28 10:20:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 10:20:44,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:44,804 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 10:20:44,805 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:44,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1260196507, now seen corresponding path program 1 times [2019-11-28 10:20:44,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:44,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611942501] [2019-11-28 10:20:44,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:44,883 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 10:20:44,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611942501] [2019-11-28 10:20:44,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:44,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:20:44,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890378838] [2019-11-28 10:20:44,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:20:44,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:44,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:20:44,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:20:44,885 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 8 states. [2019-11-28 10:20:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:45,226 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-28 10:20:45,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:20:45,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 10:20:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:45,228 INFO L225 Difference]: With dead ends: 115 [2019-11-28 10:20:45,228 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 10:20:45,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:20:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 10:20:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2019-11-28 10:20:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 10:20:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-11-28 10:20:45,234 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 21 [2019-11-28 10:20:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:45,235 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-11-28 10:20:45,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:20:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-11-28 10:20:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 10:20:45,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:45,236 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:45,236 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash -404712455, now seen corresponding path program 1 times [2019-11-28 10:20:45,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:45,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095918749] [2019-11-28 10:20:45,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:20:45,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095918749] [2019-11-28 10:20:45,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:45,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:20:45,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274268609] [2019-11-28 10:20:45,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:20:45,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:45,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:20:45,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:20:45,296 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2019-11-28 10:20:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:45,554 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2019-11-28 10:20:45,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:20:45,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 10:20:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:45,556 INFO L225 Difference]: With dead ends: 98 [2019-11-28 10:20:45,557 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 10:20:45,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:20:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 10:20:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2019-11-28 10:20:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 10:20:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2019-11-28 10:20:45,562 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 21 [2019-11-28 10:20:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:45,563 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-11-28 10:20:45,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:20:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2019-11-28 10:20:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 10:20:45,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:45,564 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:45,564 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:45,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash -404712454, now seen corresponding path program 1 times [2019-11-28 10:20:45,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:45,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047481866] [2019-11-28 10:20:45,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:20:45,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047481866] [2019-11-28 10:20:45,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:45,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:20:45,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672215672] [2019-11-28 10:20:45,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:20:45,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:20:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:20:45,661 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 7 states. [2019-11-28 10:20:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:45,940 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-28 10:20:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:20:45,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 10:20:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:45,943 INFO L225 Difference]: With dead ends: 89 [2019-11-28 10:20:45,944 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 10:20:45,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:20:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 10:20:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-11-28 10:20:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 10:20:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-28 10:20:45,948 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 21 [2019-11-28 10:20:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:45,949 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-28 10:20:45,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:20:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-28 10:20:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 10:20:45,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:45,950 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:45,951 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 10:20:45,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:45,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1029325368, now seen corresponding path program 1 times [2019-11-28 10:20:45,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:45,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419749084] [2019-11-28 10:20:45,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:20:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:20:46,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 10:20:46,051 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 10:20:46,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:20:46 BoogieIcfgContainer [2019-11-28 10:20:46,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 10:20:46,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 10:20:46,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 10:20:46,087 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 10:20:46,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:20:41" (3/4) ... [2019-11-28 10:20:46,090 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 10:20:46,149 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 10:20:46,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 10:20:46,152 INFO L168 Benchmark]: Toolchain (without parser) took 5845.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 959.0 MB in the beginning and 1.0 GB in the end (delta: -56.4 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:46,153 INFO L168 Benchmark]: CDTParser took 0.19 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 10:20:46,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:46,157 INFO L168 Benchmark]: Boogie Preprocessor took 90.05 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:46,158 INFO L168 Benchmark]: RCFGBuilder took 742.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:46,159 INFO L168 Benchmark]: TraceAbstraction took 4346.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:46,159 INFO L168 Benchmark]: Witness Printer took 62.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:20:46,166 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.19 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 591.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.05 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 742.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4346.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. * Witness Printer took 62.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 562]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L521] int flag = 1; [L522] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L523] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L524] List t; [L525] List p = a; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L528] p->h = 2 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L529] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L534] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L535] COND FALSE !(t == 0) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L536] p->n = t VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L537] EXPR p->n VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->n={-2:0}, t={-2:0}] [L537] p = p->n [L526] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-2:0}] [L540] p = a [L541] flag = 1 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L542] EXPR p->h VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=2, t={-2:0}] [L542] COND TRUE p->h != 3 [L543] COND TRUE \read(flag) [L544] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L545] EXPR p->h VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=2, t={-2:0}] [L545] COND TRUE p->h != 1 [L562] __VERIFIER_error() VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 97 locations, 30 error locations. Result: UNSAFE, OverallTime: 4.2s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 515 SDtfs, 845 SDslu, 900 SDs, 0 SdLazy, 1633 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 122 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 10974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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 incorrect! Received shutdown request...