./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 6692e4fc 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-64bit-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 64bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:26:59,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:26:59,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:26:59,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:26:59,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:26:59,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:26:59,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:26:59,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:26:59,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:26:59,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:26:59,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:26:59,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:26:59,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:26:59,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:26:59,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:26:59,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:26:59,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:26:59,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:26:59,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:26:59,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:26:59,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:26:59,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:26:59,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:26:59,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:26:59,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:26:59,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:26:59,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:26:59,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:26:59,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:26:59,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:26:59,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:26:59,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:26:59,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:26:59,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:26:59,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:26:59,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:26:59,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:26:59,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:26:59,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:26:59,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:26:59,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:26:59,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf [2019-11-25 17:26:59,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:26:59,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:26:59,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:26:59,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:26:59,925 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:26:59,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:26:59,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:26:59,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:26:59,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:26:59,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:26:59,929 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:26:59,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:26:59,930 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:26:59,930 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:26:59,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:26:59,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:26:59,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:26:59,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:26:59,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:26:59,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:26:59,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:26:59,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:26:59,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:26:59,936 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-25 17:27:00,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:27:00,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:27:00,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:27:00,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:27:00,304 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:27:00,305 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-25 17:27:00,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be64dbc5/4e5088694cdb45c983c8024e39ddb5b1/FLAG5052ae71f [2019-11-25 17:27:00,976 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:27:00,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-25 17:27:01,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be64dbc5/4e5088694cdb45c983c8024e39ddb5b1/FLAG5052ae71f [2019-11-25 17:27:01,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be64dbc5/4e5088694cdb45c983c8024e39ddb5b1 [2019-11-25 17:27:01,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:27:01,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:27:01,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:27:01,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:27:01,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:27:01,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:01,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c4700c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01, skipping insertion in model container [2019-11-25 17:27:01,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:01,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:27:01,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:27:01,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:27:01,852 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:27:01,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:27:01,975 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:27:01,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01 WrapperNode [2019-11-25 17:27:01,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:27:01,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:27:01,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:27:01,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:27:01,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:01,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:02,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:02,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:02,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:02,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:02,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (1/1) ... [2019-11-25 17:27:02,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:27:02,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:27:02,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:27:02,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:27:02,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (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-25 17:27:02,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:27:02,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:27:02,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:27:02,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:27:02,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 17:27:02,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 17:27:02,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 17:27:02,127 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-25 17:27:02,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:27:02,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:27:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:27:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:27:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:27:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:27:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:27:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:27:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:27:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:27:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:27:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:27:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:27:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:27:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:27:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:27:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:27:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:27:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:27:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:27:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:27:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 17:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 17:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 17:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:27:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:27:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:27:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:27:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:27:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:27:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:27:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:27:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:27:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:27:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:27:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:27:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:27:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:27:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:27:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:27:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:27:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:27:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:27:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:27:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:27:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:27:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:27:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:27:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:27:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:27:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:27:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:27:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:27:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:27:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:27:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:27:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:27:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:27:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:27:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:27:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:27:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:27:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:27:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:27:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:27:02,148 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:27:02,148 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:27:02,148 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:27:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:27:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:27:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:27:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:27:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:27:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:27:02,149 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:27:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:27:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:27:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:27:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:27:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:27:02,571 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-25 17:27:02,864 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:27:02,864 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-25 17:27:02,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:27:02 BoogieIcfgContainer [2019-11-25 17:27:02,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:27:02,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:27:02,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:27:02,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:27:02,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:27:01" (1/3) ... [2019-11-25 17:27:02,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69441f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:27:02, skipping insertion in model container [2019-11-25 17:27:02,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:27:01" (2/3) ... [2019-11-25 17:27:02,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69441f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:27:02, skipping insertion in model container [2019-11-25 17:27:02,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:27:02" (3/3) ... [2019-11-25 17:27:02,878 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-25 17:27:02,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:27:02,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-25 17:27:02,917 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-25 17:27:02,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:27:02,944 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:27:02,944 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:27:02,944 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:27:02,945 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:27:02,945 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:27:02,945 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:27:02,945 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:27:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-25 17:27:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:27:02,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:02,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:27:02,981 INFO L410 AbstractCegarLoop]: === Iteration 1 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 63975510, now seen corresponding path program 1 times [2019-11-25 17:27:02,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:02,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604530554] [2019-11-25 17:27:02,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:03,193 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-25 17:27:03,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604530554] [2019-11-25 17:27:03,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:03,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:27:03,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76041756] [2019-11-25 17:27:03,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:27:03,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:03,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:27:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:27:03,224 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-25 17:27:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:03,500 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-25 17:27:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:27:03,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 17:27:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:03,512 INFO L225 Difference]: With dead ends: 80 [2019-11-25 17:27:03,513 INFO L226 Difference]: Without dead ends: 72 [2019-11-25 17:27:03,521 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-25 17:27:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-25 17:27:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-25 17:27:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 17:27:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-25 17:27:03,570 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-11-25 17:27:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:03,570 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-25 17:27:03,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:27:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-25 17:27:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 17:27:03,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:03,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:27:03,572 INFO L410 AbstractCegarLoop]: === Iteration 2 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:03,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205163, now seen corresponding path program 1 times [2019-11-25 17:27:03,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:03,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564369704] [2019-11-25 17:27:03,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:03,706 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-25 17:27:03,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564369704] [2019-11-25 17:27:03,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:03,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:27:03,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114399471] [2019-11-25 17:27:03,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:27:03,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:27:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:27:03,711 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2019-11-25 17:27:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:04,002 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-25 17:27:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:27:04,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-25 17:27:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:04,005 INFO L225 Difference]: With dead ends: 93 [2019-11-25 17:27:04,005 INFO L226 Difference]: Without dead ends: 93 [2019-11-25 17:27:04,006 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-25 17:27:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-25 17:27:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-11-25 17:27:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 17:27:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-11-25 17:27:04,019 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-11-25 17:27:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:04,020 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-11-25 17:27:04,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:27:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-11-25 17:27:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 17:27:04,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:04,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:27:04,024 INFO L410 AbstractCegarLoop]: === Iteration 3 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205164, now seen corresponding path program 1 times [2019-11-25 17:27:04,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:04,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524102007] [2019-11-25 17:27:04,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:04,147 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-25 17:27:04,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524102007] [2019-11-25 17:27:04,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:04,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:27:04,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188224626] [2019-11-25 17:27:04,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:27:04,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:27:04,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:27:04,155 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 5 states. [2019-11-25 17:27:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:04,488 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-25 17:27:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:27:04,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-25 17:27:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:04,490 INFO L225 Difference]: With dead ends: 99 [2019-11-25 17:27:04,490 INFO L226 Difference]: Without dead ends: 99 [2019-11-25 17:27:04,491 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-25 17:27:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-25 17:27:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-11-25 17:27:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 17:27:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-11-25 17:27:04,501 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-11-25 17:27:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:04,502 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-11-25 17:27:04,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:27:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-11-25 17:27:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:27:04,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:04,504 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-25 17:27:04,505 INFO L410 AbstractCegarLoop]: === Iteration 4 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2096806293, now seen corresponding path program 1 times [2019-11-25 17:27:04,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:04,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594995514] [2019-11-25 17:27:04,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:04,623 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-25 17:27:04,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594995514] [2019-11-25 17:27:04,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:04,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:27:04,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708246425] [2019-11-25 17:27:04,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:27:04,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:27:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:27:04,626 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 5 states. [2019-11-25 17:27:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:04,849 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-11-25 17:27:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:27:04,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-25 17:27:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:04,850 INFO L225 Difference]: With dead ends: 95 [2019-11-25 17:27:04,851 INFO L226 Difference]: Without dead ends: 95 [2019-11-25 17:27:04,851 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-25 17:27:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-25 17:27:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-11-25 17:27:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 17:27:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-25 17:27:04,859 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-11-25 17:27:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:04,860 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-25 17:27:04,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:27:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-25 17:27:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 17:27:04,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:04,861 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-25 17:27:04,862 INFO L410 AbstractCegarLoop]: === Iteration 5 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash 576531525, now seen corresponding path program 1 times [2019-11-25 17:27:04,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:04,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73241732] [2019-11-25 17:27:04,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:04,984 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-25 17:27:04,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73241732] [2019-11-25 17:27:04,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:04,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:27:04,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227768472] [2019-11-25 17:27:04,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:27:04,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:27:04,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:27:04,991 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 6 states. [2019-11-25 17:27:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:05,262 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-25 17:27:05,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:27:05,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-25 17:27:05,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:05,264 INFO L225 Difference]: With dead ends: 99 [2019-11-25 17:27:05,264 INFO L226 Difference]: Without dead ends: 99 [2019-11-25 17:27:05,265 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-25 17:27:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-25 17:27:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-11-25 17:27:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 17:27:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-11-25 17:27:05,274 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-11-25 17:27:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:05,275 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-11-25 17:27:05,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:27:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-11-25 17:27:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 17:27:05,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:05,277 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-25 17:27:05,278 INFO L410 AbstractCegarLoop]: === Iteration 6 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:05,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1548979245, now seen corresponding path program 1 times [2019-11-25 17:27:05,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:05,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315926545] [2019-11-25 17:27:05,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:05,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315926545] [2019-11-25 17:27:05,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:05,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:27:05,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046910879] [2019-11-25 17:27:05,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:27:05,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:27:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:27:05,369 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-11-25 17:27:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:05,710 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-11-25 17:27:05,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:27:05,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-25 17:27:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:05,712 INFO L225 Difference]: With dead ends: 132 [2019-11-25 17:27:05,712 INFO L226 Difference]: Without dead ends: 132 [2019-11-25 17:27:05,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:27:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-25 17:27:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-11-25 17:27:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-25 17:27:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-11-25 17:27:05,721 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 20 [2019-11-25 17:27:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:05,722 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-11-25 17:27:05,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:27:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-11-25 17:27:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:27:05,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:05,723 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-25 17:27:05,724 INFO L410 AbstractCegarLoop]: === Iteration 7 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash 691191193, now seen corresponding path program 1 times [2019-11-25 17:27:05,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:05,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668891653] [2019-11-25 17:27:05,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:05,874 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-25 17:27:05,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668891653] [2019-11-25 17:27:05,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:05,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:27:05,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857069378] [2019-11-25 17:27:05,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:27:05,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:05,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:27:05,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:27:05,879 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2019-11-25 17:27:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:06,143 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-25 17:27:06,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:27:06,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-25 17:27:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:06,148 INFO L225 Difference]: With dead ends: 109 [2019-11-25 17:27:06,148 INFO L226 Difference]: Without dead ends: 105 [2019-11-25 17:27:06,148 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-25 17:27:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-25 17:27:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-11-25 17:27:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 17:27:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-25 17:27:06,155 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 21 [2019-11-25 17:27:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:06,155 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-25 17:27:06,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:27:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-25 17:27:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:27:06,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:06,156 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-25 17:27:06,157 INFO L410 AbstractCegarLoop]: === Iteration 8 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:06,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash 692608250, now seen corresponding path program 1 times [2019-11-25 17:27:06,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:06,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241188942] [2019-11-25 17:27:06,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:06,254 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-25 17:27:06,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241188942] [2019-11-25 17:27:06,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:06,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 17:27:06,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264107501] [2019-11-25 17:27:06,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:27:06,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:27:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:27:06,256 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 8 states. [2019-11-25 17:27:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:06,601 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-25 17:27:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:27:06,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 17:27:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:06,603 INFO L225 Difference]: With dead ends: 111 [2019-11-25 17:27:06,603 INFO L226 Difference]: Without dead ends: 104 [2019-11-25 17:27:06,604 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-25 17:27:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-25 17:27:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-11-25 17:27:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 17:27:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-25 17:27:06,610 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 21 [2019-11-25 17:27:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:06,610 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-25 17:27:06,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:27:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-25 17:27:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:27:06,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:06,611 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-25 17:27:06,611 INFO L410 AbstractCegarLoop]: === Iteration 9 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:06,612 INFO L82 PathProgramCache]: Analyzing trace with hash -972300712, now seen corresponding path program 1 times [2019-11-25 17:27:06,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:06,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250431484] [2019-11-25 17:27:06,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:06,680 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-25 17:27:06,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250431484] [2019-11-25 17:27:06,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:06,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:27:06,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958042922] [2019-11-25 17:27:06,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:27:06,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:06,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:27:06,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:27:06,683 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 7 states. [2019-11-25 17:27:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:07,004 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-25 17:27:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:27:07,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 17:27:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:07,006 INFO L225 Difference]: With dead ends: 96 [2019-11-25 17:27:07,006 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 17:27:07,007 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-25 17:27:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 17:27:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-25 17:27:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 17:27:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-25 17:27:07,012 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 21 [2019-11-25 17:27:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:07,013 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-25 17:27:07,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:27:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-11-25 17:27:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:27:07,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:07,014 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-25 17:27:07,014 INFO L410 AbstractCegarLoop]: === Iteration 10 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash -972300711, now seen corresponding path program 1 times [2019-11-25 17:27:07,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:07,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666052994] [2019-11-25 17:27:07,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:07,122 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-25 17:27:07,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666052994] [2019-11-25 17:27:07,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:07,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:27:07,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054310770] [2019-11-25 17:27:07,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:27:07,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:27:07,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:27:07,126 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 7 states. [2019-11-25 17:27:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:07,526 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-25 17:27:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:27:07,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 17:27:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:07,528 INFO L225 Difference]: With dead ends: 87 [2019-11-25 17:27:07,529 INFO L226 Difference]: Without dead ends: 87 [2019-11-25 17:27:07,529 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-25 17:27:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-25 17:27:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-25 17:27:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-25 17:27:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-25 17:27:07,534 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 21 [2019-11-25 17:27:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:07,534 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-25 17:27:07,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:27:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-25 17:27:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:27:07,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:07,536 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, 1, 1] [2019-11-25 17:27:07,537 INFO L410 AbstractCegarLoop]: === Iteration 11 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1951842208, now seen corresponding path program 1 times [2019-11-25 17:27:07,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:07,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773717690] [2019-11-25 17:27:07,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:07,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773717690] [2019-11-25 17:27:07,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232023778] [2019-11-25 17:27:07,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:07,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 17:27:07,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:27:07,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:27:07,950 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:07,962 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:07,966 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:07,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:27:08,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 17:27:08,051 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,067 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,068 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-25 17:27:08,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:27:08,123 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,138 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,138 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-25 17:27:08,194 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|], 2=[|v_#memory_int_16|]} [2019-11-25 17:27:08,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:08,205 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,225 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:08,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 17:27:08,236 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,255 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,256 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-11-25 17:27:08,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 17:27:08,302 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,316 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,317 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-25 17:27:08,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 17:27:08,387 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,404 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,405 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:08,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-11-25 17:27:08,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 17:27:08,544 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,554 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:08,556 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-11-25 17:27:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:08,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:27:08,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-11-25 17:27:08,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786077240] [2019-11-25 17:27:08,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 17:27:08,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 17:27:08,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:27:08,572 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 23 states. [2019-11-25 17:27:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:10,416 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2019-11-25 17:27:10,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-25 17:27:10,417 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-11-25 17:27:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:10,419 INFO L225 Difference]: With dead ends: 194 [2019-11-25 17:27:10,419 INFO L226 Difference]: Without dead ends: 191 [2019-11-25 17:27:10,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2019-11-25 17:27:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-25 17:27:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2019-11-25 17:27:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-25 17:27:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-11-25 17:27:10,437 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 30 [2019-11-25 17:27:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:10,439 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-11-25 17:27:10,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 17:27:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-11-25 17:27:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 17:27:10,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:10,444 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, 1, 1, 1] [2019-11-25 17:27:10,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:10,645 INFO L410 AbstractCegarLoop]: === Iteration 12 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:10,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:10,646 INFO L82 PathProgramCache]: Analyzing trace with hash 295041158, now seen corresponding path program 1 times [2019-11-25 17:27:10,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:10,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802302699] [2019-11-25 17:27:10,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:10,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802302699] [2019-11-25 17:27:10,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429582450] [2019-11-25 17:27:10,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:10,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:27:10,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:27:11,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:27:11,000 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,009 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,010 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:27:11,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 17:27:11,061 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,078 INFO L588 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-25 17:27:11,078 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-25 17:27:11,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:27:11,119 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,129 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,130 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-25 17:27:11,167 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_15|], 2=[|v_#memory_int_19|]} [2019-11-25 17:27:11,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:11,178 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,193 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:11,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 17:27:11,200 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,214 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,215 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-25 17:27:11,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 17:27:11,250 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,257 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,257 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-25 17:27:11,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 17:27:11,317 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,331 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,332 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:11,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-25 17:27:11,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 17:27:11,421 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,424 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,425 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-25 17:27:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:11,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:27:11,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-25 17:27:11,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076989321] [2019-11-25 17:27:11,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-25 17:27:11,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-25 17:27:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-11-25 17:27:11,446 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 24 states. [2019-11-25 17:27:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:12,827 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2019-11-25 17:27:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 17:27:12,827 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-25 17:27:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:12,829 INFO L225 Difference]: With dead ends: 183 [2019-11-25 17:27:12,829 INFO L226 Difference]: Without dead ends: 179 [2019-11-25 17:27:12,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 17:27:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-25 17:27:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2019-11-25 17:27:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 17:27:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-25 17:27:12,837 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 31 [2019-11-25 17:27:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:12,837 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-25 17:27:12,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-25 17:27:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-25 17:27:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 17:27:12,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:12,839 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:27:13,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:13,055 INFO L410 AbstractCegarLoop]: === Iteration 13 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash 384991059, now seen corresponding path program 2 times [2019-11-25 17:27:13,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:13,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407594559] [2019-11-25 17:27:13,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 17:27:13,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407594559] [2019-11-25 17:27:13,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:27:13,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:27:13,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730331948] [2019-11-25 17:27:13,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:27:13,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:27:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:27:13,125 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2019-11-25 17:27:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:13,254 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-25 17:27:13,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:27:13,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-25 17:27:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:13,256 INFO L225 Difference]: With dead ends: 131 [2019-11-25 17:27:13,256 INFO L226 Difference]: Without dead ends: 131 [2019-11-25 17:27:13,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:27:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-25 17:27:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2019-11-25 17:27:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 17:27:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-25 17:27:13,263 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 40 [2019-11-25 17:27:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:13,264 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-25 17:27:13,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:27:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-25 17:27:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 17:27:13,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:13,266 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2019-11-25 17:27:13,267 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash -232317747, now seen corresponding path program 1 times [2019-11-25 17:27:13,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:13,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616256001] [2019-11-25 17:27:13,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:13,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616256001] [2019-11-25 17:27:13,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970675615] [2019-11-25 17:27:13,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:13,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-25 17:27:13,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:27:13,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:27:13,768 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,774 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,774 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:27:13,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 17:27:13,831 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,844 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,844 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-25 17:27:13,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:27:13,883 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,894 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,894 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-25 17:27:13,925 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_16|], 2=[|v_#memory_int_22|]} [2019-11-25 17:27:13,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:13,929 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,951 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:13,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 17:27:13,958 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,975 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,976 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2019-11-25 17:27:14,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 17:27:14,027 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,036 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,037 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-11-25 17:27:14,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 17:27:14,110 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,123 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,123 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-25 17:27:14,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:27:14,167 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,178 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,179 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2019-11-25 17:27:14,216 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_17|], 6=[|v_#memory_int_24|]} [2019-11-25 17:27:14,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:14,221 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,241 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:14,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-25 17:27:14,248 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,260 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,261 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2019-11-25 17:27:14,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 17:27:14,317 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,329 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,330 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:14,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-11-25 17:27:14,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-25 17:27:14,460 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,505 INFO L588 ElimStorePlain]: treesize reduction 16, result has 73.3 percent of original size [2019-11-25 17:27:14,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:14,510 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:14,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:44 [2019-11-25 17:27:14,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:14,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:14,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 17:27:14,676 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,684 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,684 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-11-25 17:27:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:14,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:27:14,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2019-11-25 17:27:14,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421403490] [2019-11-25 17:27:14,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 17:27:14,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:14,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 17:27:14,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2019-11-25 17:27:14,704 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 32 states. [2019-11-25 17:27:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:16,127 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-25 17:27:16,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-25 17:27:16,128 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-25 17:27:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:16,129 INFO L225 Difference]: With dead ends: 57 [2019-11-25 17:27:16,129 INFO L226 Difference]: Without dead ends: 54 [2019-11-25 17:27:16,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=429, Invalid=2433, Unknown=0, NotChecked=0, Total=2862 [2019-11-25 17:27:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-25 17:27:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-25 17:27:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 17:27:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-11-25 17:27:16,135 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 40 [2019-11-25 17:27:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:16,136 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-11-25 17:27:16,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 17:27:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-11-25 17:27:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 17:27:16,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:16,138 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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-25 17:27:16,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:16,342 INFO L410 AbstractCegarLoop]: === Iteration 15 === [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, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1305559289, now seen corresponding path program 1 times [2019-11-25 17:27:16,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:27:16,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515609680] [2019-11-25 17:27:16,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:27:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:16,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515609680] [2019-11-25 17:27:16,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327495717] [2019-11-25 17:27:16,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:16,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-25 17:27:16,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:27:16,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:27:16,880 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,888 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,888 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:27:16,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 17:27:16,989 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,019 INFO L588 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-25 17:27:17,020 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-25 17:27:17,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:27:17,070 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,082 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,082 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-25 17:27:17,172 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_18|], 2=[|v_#memory_int_27|]} [2019-11-25 17:27:17,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:17,178 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,199 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:17,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 17:27:17,205 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,219 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,220 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-25 17:27:17,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 17:27:17,269 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,278 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,279 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-11-25 17:27:17,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 17:27:17,362 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,372 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,372 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-25 17:27:17,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:27:17,424 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,436 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,436 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-25 17:27:17,474 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_19|], 6=[|v_#memory_int_29|]} [2019-11-25 17:27:17,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:17,479 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,495 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:17,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-25 17:27:17,501 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,517 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,517 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-25 17:27:17,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 17:27:17,582 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,590 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,591 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:17,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2019-11-25 17:27:17,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-25 17:27:17,710 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,748 INFO L588 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-25 17:27:17,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:17,751 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:17,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:41 [2019-11-25 17:27:17,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:17,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 17:27:17,900 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,904 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,904 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-25 17:27:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:17,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:27:17,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2019-11-25 17:27:17,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741841489] [2019-11-25 17:27:17,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 17:27:17,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:27:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 17:27:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 17:27:17,937 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 34 states. [2019-11-25 17:27:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:19,051 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-11-25 17:27:19,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-25 17:27:19,052 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-11-25 17:27:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:19,052 INFO L225 Difference]: With dead ends: 46 [2019-11-25 17:27:19,052 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:27:19,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=424, Invalid=2438, Unknown=0, NotChecked=0, Total=2862 [2019-11-25 17:27:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:27:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:27:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:27:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:27:19,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-25 17:27:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:19,056 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:27:19,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 17:27:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:27:19,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:27:19,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:27:19,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:27:19 BoogieIcfgContainer [2019-11-25 17:27:19,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:27:19,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:27:19,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:27:19,264 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:27:19,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:27:02" (3/4) ... [2019-11-25 17:27:19,269 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:27:19,278 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:27:19,278 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-25 17:27:19,278 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 17:27:19,279 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 17:27:19,279 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 17:27:19,279 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 17:27:19,280 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:27:19,280 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 17:27:19,287 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 17:27:19,287 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 17:27:19,288 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:27:19,288 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:27:19,348 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:27:19,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:27:19,350 INFO L168 Benchmark]: Toolchain (without parser) took 18069.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.3 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 224.2 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:19,350 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:27:19,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:19,350 INFO L168 Benchmark]: Boogie Preprocessor took 81.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:19,351 INFO L168 Benchmark]: RCFGBuilder took 806.32 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.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:19,351 INFO L168 Benchmark]: TraceAbstraction took 16394.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.5 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:19,352 INFO L168 Benchmark]: Witness Printer took 85.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:27:19,353 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 806.32 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.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16394.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.5 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. * Witness Printer took 85.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 29 error locations. Result: SAFE, OverallTime: 16.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 707 SDtfs, 1576 SDslu, 2444 SDs, 0 SdLazy, 4405 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=11, 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, 15 MinimizatonAttempts, 316 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 480 ConstructedInterpolants, 22 QuantifiedInterpolants, 144152 SizeOfPredicates, 65 NumberOfNonLiveVariables, 662 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 24/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...