./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c1f4b5c4 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/forester-heap/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f270b702de634d3ad2ee5a400388c6410a4cf10 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/forester-heap/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f270b702de634d3ad2ee5a400388c6410a4cf10 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-c1f4b5c [2019-12-08 16:03:20,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 16:03:20,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 16:03:20,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 16:03:20,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 16:03:20,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 16:03:20,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 16:03:20,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 16:03:20,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 16:03:20,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 16:03:20,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 16:03:20,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 16:03:20,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 16:03:20,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 16:03:20,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 16:03:20,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 16:03:20,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 16:03:20,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 16:03:20,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 16:03:20,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 16:03:20,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 16:03:20,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 16:03:20,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 16:03:20,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 16:03:20,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 16:03:20,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 16:03:20,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 16:03:20,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 16:03:20,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 16:03:20,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 16:03:20,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 16:03:20,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 16:03:20,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 16:03:20,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 16:03:20,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 16:03:20,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 16:03:20,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 16:03:20,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 16:03:20,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 16:03:20,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 16:03:20,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 16:03:20,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-08 16:03:20,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 16:03:20,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 16:03:20,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 16:03:20,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 16:03:20,915 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 16:03:20,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 16:03:20,916 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 16:03:20,916 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-08 16:03:20,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 16:03:20,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 16:03:20,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 16:03:20,917 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-08 16:03:20,917 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-08 16:03:20,917 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-08 16:03:20,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 16:03:20,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-08 16:03:20,918 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 16:03:20,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 16:03:20,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 16:03:20,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 16:03:20,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 16:03:20,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 16:03:20,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 16:03:20,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 16:03:20,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 16:03:20,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-08 16:03:20,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-08 16:03:20,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 16:03:20,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2019-12-08 16:03:21,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 16:03:21,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 16:03:21,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 16:03:21,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 16:03:21,304 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 16:03:21,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-08 16:03:21,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8361d4bc5/72ead53fe69e4f36b1ac966f5f30c196/FLAG3e3fa8b7f [2019-12-08 16:03:21,890 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 16:03:21,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-08 16:03:21,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8361d4bc5/72ead53fe69e4f36b1ac966f5f30c196/FLAG3e3fa8b7f [2019-12-08 16:03:22,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8361d4bc5/72ead53fe69e4f36b1ac966f5f30c196 [2019-12-08 16:03:22,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 16:03:22,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-08 16:03:22,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 16:03:22,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 16:03:22,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 16:03:22,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f6df51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22, skipping insertion in model container [2019-12-08 16:03:22,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 16:03:22,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:03:22,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:03:22,690 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 16:03:22,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:03:22,794 INFO L208 MainTranslator]: Completed translation [2019-12-08 16:03:22,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22 WrapperNode [2019-12-08 16:03:22,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 16:03:22,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 16:03:22,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 16:03:22,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 16:03:22,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (1/1) ... [2019-12-08 16:03:22,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 16:03:22,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 16:03:22,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 16:03:22,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 16:03:22,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (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-12-08 16:03:22,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-08 16:03:22,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 16:03:22,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-08 16:03:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-08 16:03:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-08 16:03:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-08 16:03:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-08 16:03:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-08 16:03:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-08 16:03:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-08 16:03:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-08 16:03:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-08 16:03:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-08 16:03:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-08 16:03:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-08 16:03:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-08 16:03:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-08 16:03:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-08 16:03:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-08 16:03:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-08 16:03:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-08 16:03:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-08 16:03:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-08 16:03:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-08 16:03:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-08 16:03:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-08 16:03:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-08 16:03:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-08 16:03:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-08 16:03:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-08 16:03:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-08 16:03:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-08 16:03:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-08 16:03:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-08 16:03:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-08 16:03:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-08 16:03:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-08 16:03:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-08 16:03:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-08 16:03:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-08 16:03:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-08 16:03:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-08 16:03:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-08 16:03:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-08 16:03:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-08 16:03:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-08 16:03:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-08 16:03:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-08 16:03:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-08 16:03:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-08 16:03:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-08 16:03:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-08 16:03:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-08 16:03:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-08 16:03:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-08 16:03:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-08 16:03:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-08 16:03:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-08 16:03:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-08 16:03:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-08 16:03:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-08 16:03:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-08 16:03:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-08 16:03:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-08 16:03:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-08 16:03:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-08 16:03:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-08 16:03:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-08 16:03:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-08 16:03:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-08 16:03:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-08 16:03:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-08 16:03:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-08 16:03:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-08 16:03:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-08 16:03:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-08 16:03:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-08 16:03:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-08 16:03:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-08 16:03:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-08 16:03:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-08 16:03:22,946 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-08 16:03:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-08 16:03:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-08 16:03:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-08 16:03:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-08 16:03:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-08 16:03:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-08 16:03:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-08 16:03:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-08 16:03:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-08 16:03:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-08 16:03:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-08 16:03:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-08 16:03:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-08 16:03:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-08 16:03:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-08 16:03:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-08 16:03:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-08 16:03:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-08 16:03:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 16:03:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-08 16:03:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 16:03:23,720 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 16:03:23,720 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-08 16:03:23,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:03:23 BoogieIcfgContainer [2019-12-08 16:03:23,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 16:03:23,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 16:03:23,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 16:03:23,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 16:03:23,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:03:22" (1/3) ... [2019-12-08 16:03:23,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5019c7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:03:23, skipping insertion in model container [2019-12-08 16:03:23,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:22" (2/3) ... [2019-12-08 16:03:23,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5019c7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:03:23, skipping insertion in model container [2019-12-08 16:03:23,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:03:23" (3/3) ... [2019-12-08 16:03:23,734 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2019-12-08 16:03:23,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 16:03:23,764 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2019-12-08 16:03:23,782 INFO L249 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2019-12-08 16:03:23,804 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 16:03:23,804 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-08 16:03:23,804 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 16:03:23,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 16:03:23,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 16:03:23,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 16:03:23,806 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 16:03:23,806 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 16:03:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-12-08 16:03:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-08 16:03:23,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:23,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:23,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1311984285, now seen corresponding path program 1 times [2019-12-08 16:03:23,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:23,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966479132] [2019-12-08 16:03:23,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:24,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966479132] [2019-12-08 16:03:24,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:24,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 16:03:24,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326226494] [2019-12-08 16:03:24,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:03:24,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:24,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:03:24,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:03:24,107 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2019-12-08 16:03:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:24,583 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-12-08 16:03:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:03:24,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-08 16:03:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:24,598 INFO L225 Difference]: With dead ends: 141 [2019-12-08 16:03:24,598 INFO L226 Difference]: Without dead ends: 137 [2019-12-08 16:03:24,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-08 16:03:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-12-08 16:03:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-08 16:03:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2019-12-08 16:03:24,651 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 7 [2019-12-08 16:03:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:24,651 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2019-12-08 16:03:24,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:03:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2019-12-08 16:03:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-08 16:03:24,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:24,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:24,654 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1311984284, now seen corresponding path program 1 times [2019-12-08 16:03:24,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:24,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203678045] [2019-12-08 16:03:24,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:24,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203678045] [2019-12-08 16:03:24,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:24,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 16:03:24,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695245483] [2019-12-08 16:03:24,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:03:24,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:03:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:03:24,726 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 4 states. [2019-12-08 16:03:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:25,145 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2019-12-08 16:03:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 16:03:25,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-08 16:03:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:25,148 INFO L225 Difference]: With dead ends: 150 [2019-12-08 16:03:25,148 INFO L226 Difference]: Without dead ends: 150 [2019-12-08 16:03:25,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:03:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-08 16:03:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2019-12-08 16:03:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-08 16:03:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2019-12-08 16:03:25,175 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 7 [2019-12-08 16:03:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:25,175 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2019-12-08 16:03:25,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:03:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2019-12-08 16:03:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-08 16:03:25,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:25,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:25,178 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:25,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:25,179 INFO L82 PathProgramCache]: Analyzing trace with hash 999637548, now seen corresponding path program 1 times [2019-12-08 16:03:25,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:25,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880801711] [2019-12-08 16:03:25,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:25,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880801711] [2019-12-08 16:03:25,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:25,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-08 16:03:25,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908331861] [2019-12-08 16:03:25,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:03:25,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:03:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:25,336 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 5 states. [2019-12-08 16:03:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:25,737 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2019-12-08 16:03:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:03:25,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-08 16:03:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:25,741 INFO L225 Difference]: With dead ends: 142 [2019-12-08 16:03:25,741 INFO L226 Difference]: Without dead ends: 142 [2019-12-08 16:03:25,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12-08 16:03:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-08 16:03:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2019-12-08 16:03:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-08 16:03:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2019-12-08 16:03:25,751 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 13 [2019-12-08 16:03:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:25,752 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2019-12-08 16:03:25,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:03:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2019-12-08 16:03:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-08 16:03:25,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:25,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:25,753 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 999637549, now seen corresponding path program 1 times [2019-12-08 16:03:25,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:25,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93606653] [2019-12-08 16:03:25,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:25,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93606653] [2019-12-08 16:03:25,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:25,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-08 16:03:25,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907580912] [2019-12-08 16:03:25,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:03:25,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:25,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:03:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:25,843 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 5 states. [2019-12-08 16:03:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:26,235 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2019-12-08 16:03:26,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:03:26,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-08 16:03:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:26,238 INFO L225 Difference]: With dead ends: 170 [2019-12-08 16:03:26,238 INFO L226 Difference]: Without dead ends: 170 [2019-12-08 16:03:26,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12-08 16:03:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-08 16:03:26,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 139. [2019-12-08 16:03:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-08 16:03:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2019-12-08 16:03:26,258 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 13 [2019-12-08 16:03:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:26,258 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2019-12-08 16:03:26,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:03:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2019-12-08 16:03:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-08 16:03:26,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:26,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:26,261 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1420996668, now seen corresponding path program 1 times [2019-12-08 16:03:26,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:26,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812539866] [2019-12-08 16:03:26,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:26,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812539866] [2019-12-08 16:03:26,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:26,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 16:03:26,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265974216] [2019-12-08 16:03:26,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:03:26,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:03:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:26,332 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 5 states. [2019-12-08 16:03:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:26,664 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2019-12-08 16:03:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:03:26,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-08 16:03:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:26,666 INFO L225 Difference]: With dead ends: 155 [2019-12-08 16:03:26,666 INFO L226 Difference]: Without dead ends: 155 [2019-12-08 16:03:26,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12-08 16:03:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-08 16:03:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2019-12-08 16:03:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-08 16:03:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2019-12-08 16:03:26,674 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 15 [2019-12-08 16:03:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:26,674 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2019-12-08 16:03:26,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:03:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2019-12-08 16:03:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-08 16:03:26,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:26,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:26,675 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1420990801, now seen corresponding path program 1 times [2019-12-08 16:03:26,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:26,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307169018] [2019-12-08 16:03:26,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:26,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307169018] [2019-12-08 16:03:26,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:26,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 16:03:26,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794601262] [2019-12-08 16:03:26,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:03:26,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:26,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:03:26,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 16:03:26,768 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 6 states. [2019-12-08 16:03:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:27,221 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2019-12-08 16:03:27,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:03:27,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-08 16:03:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:27,223 INFO L225 Difference]: With dead ends: 190 [2019-12-08 16:03:27,223 INFO L226 Difference]: Without dead ends: 190 [2019-12-08 16:03:27,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:03:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-08 16:03:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 136. [2019-12-08 16:03:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-08 16:03:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-12-08 16:03:27,229 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 15 [2019-12-08 16:03:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:27,230 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-12-08 16:03:27,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:03:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-12-08 16:03:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-08 16:03:27,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:27,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:27,231 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1420990800, now seen corresponding path program 1 times [2019-12-08 16:03:27,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:27,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674166495] [2019-12-08 16:03:27,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:27,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674166495] [2019-12-08 16:03:27,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:27,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 16:03:27,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911632441] [2019-12-08 16:03:27,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:03:27,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:03:27,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 16:03:27,317 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 6 states. [2019-12-08 16:03:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:27,854 INFO L93 Difference]: Finished difference Result 216 states and 233 transitions. [2019-12-08 16:03:27,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 16:03:27,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-08 16:03:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:27,856 INFO L225 Difference]: With dead ends: 216 [2019-12-08 16:03:27,856 INFO L226 Difference]: Without dead ends: 216 [2019-12-08 16:03:27,857 INFO L631 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-12-08 16:03:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-08 16:03:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 135. [2019-12-08 16:03:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-08 16:03:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2019-12-08 16:03:27,863 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 15 [2019-12-08 16:03:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:27,864 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2019-12-08 16:03:27,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:03:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2019-12-08 16:03:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-08 16:03:27,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:27,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:27,866 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1710066916, now seen corresponding path program 1 times [2019-12-08 16:03:27,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:27,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588498332] [2019-12-08 16:03:27,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:27,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588498332] [2019-12-08 16:03:27,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:27,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:03:27,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009196550] [2019-12-08 16:03:27,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:03:27,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:03:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:03:27,979 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 7 states. [2019-12-08 16:03:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:28,377 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2019-12-08 16:03:28,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 16:03:28,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-08 16:03:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:28,379 INFO L225 Difference]: With dead ends: 195 [2019-12-08 16:03:28,379 INFO L226 Difference]: Without dead ends: 195 [2019-12-08 16:03:28,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:03:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-08 16:03:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 140. [2019-12-08 16:03:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-08 16:03:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2019-12-08 16:03:28,383 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 18 [2019-12-08 16:03:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:28,383 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2019-12-08 16:03:28,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:03:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2019-12-08 16:03:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-08 16:03:28,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:28,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:28,385 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:28,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash -473076751, now seen corresponding path program 1 times [2019-12-08 16:03:28,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:28,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550054275] [2019-12-08 16:03:28,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:28,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550054275] [2019-12-08 16:03:28,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:28,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-08 16:03:28,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308789033] [2019-12-08 16:03:28,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-08 16:03:28,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-08 16:03:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:03:28,521 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 10 states. [2019-12-08 16:03:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:29,141 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2019-12-08 16:03:29,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-08 16:03:29,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-08 16:03:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:29,142 INFO L225 Difference]: With dead ends: 140 [2019-12-08 16:03:29,143 INFO L226 Difference]: Without dead ends: 140 [2019-12-08 16:03:29,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-08 16:03:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-08 16:03:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-12-08 16:03:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-08 16:03:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2019-12-08 16:03:29,148 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 19 [2019-12-08 16:03:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:29,149 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2019-12-08 16:03:29,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-08 16:03:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2019-12-08 16:03:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-08 16:03:29,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:29,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:29,150 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -473076750, now seen corresponding path program 1 times [2019-12-08 16:03:29,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:29,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683679060] [2019-12-08 16:03:29,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:29,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683679060] [2019-12-08 16:03:29,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:29,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-08 16:03:29,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811439823] [2019-12-08 16:03:29,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-08 16:03:29,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-08 16:03:29,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-08 16:03:29,359 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 11 states. [2019-12-08 16:03:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:30,422 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2019-12-08 16:03:30,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-08 16:03:30,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-08 16:03:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:30,425 INFO L225 Difference]: With dead ends: 143 [2019-12-08 16:03:30,426 INFO L226 Difference]: Without dead ends: 143 [2019-12-08 16:03:30,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-12-08 16:03:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-08 16:03:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2019-12-08 16:03:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-08 16:03:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2019-12-08 16:03:30,430 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 19 [2019-12-08 16:03:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:30,430 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2019-12-08 16:03:30,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-08 16:03:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2019-12-08 16:03:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-08 16:03:30,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:30,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:30,432 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1696797635, now seen corresponding path program 1 times [2019-12-08 16:03:30,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:30,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797161714] [2019-12-08 16:03:30,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:30,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797161714] [2019-12-08 16:03:30,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:30,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:03:30,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553359809] [2019-12-08 16:03:30,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:03:30,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:03:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:03:30,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 16:03:30,530 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand 6 states. [2019-12-08 16:03:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:30,774 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2019-12-08 16:03:30,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:03:30,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-08 16:03:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:30,775 INFO L225 Difference]: With dead ends: 140 [2019-12-08 16:03:30,776 INFO L226 Difference]: Without dead ends: 140 [2019-12-08 16:03:30,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:03:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-08 16:03:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2019-12-08 16:03:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-08 16:03:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2019-12-08 16:03:30,780 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 24 [2019-12-08 16:03:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:30,780 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2019-12-08 16:03:30,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:03:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2019-12-08 16:03:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-08 16:03:30,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:30,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:30,782 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1697108517, now seen corresponding path program 1 times [2019-12-08 16:03:30,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:03:30,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143988827] [2019-12-08 16:03:30,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:03:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 16:03:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 16:03:30,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-08 16:03:30,834 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-08 16:03:30,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:03:30 BoogieIcfgContainer [2019-12-08 16:03:30,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 16:03:30,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 16:03:30,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 16:03:30,879 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 16:03:30,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:03:23" (3/4) ... [2019-12-08 16:03:30,883 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-08 16:03:30,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 16:03:30,886 INFO L168 Benchmark]: Toolchain (without parser) took 8688.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -200.5 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2019-12-08 16:03:30,887 INFO L168 Benchmark]: CDTParser took 0.26 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-12-08 16:03:30,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-08 16:03:30,893 INFO L168 Benchmark]: Boogie Preprocessor took 69.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-12-08 16:03:30,894 INFO L168 Benchmark]: RCFGBuilder took 856.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-12-08 16:03:30,896 INFO L168 Benchmark]: TraceAbstraction took 7154.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-12-08 16:03:30,900 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:03:30,908 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.26 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 597.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 856.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7154.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1040. Possible FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L996] list->prev = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L997] list->colour = BLACK VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L999] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1030] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1034] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 65 error locations. Result: UNSAFE, OverallTime: 7.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 891 SDtfs, 1468 SDslu, 1462 SDs, 0 SdLazy, 3822 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 286 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 12068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-c1f4b5c [2019-12-08 16:03:32,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 16:03:32,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 16:03:32,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 16:03:32,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 16:03:32,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 16:03:32,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 16:03:33,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 16:03:33,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 16:03:33,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 16:03:33,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 16:03:33,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 16:03:33,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 16:03:33,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 16:03:33,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 16:03:33,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 16:03:33,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 16:03:33,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 16:03:33,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 16:03:33,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 16:03:33,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 16:03:33,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 16:03:33,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 16:03:33,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 16:03:33,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 16:03:33,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 16:03:33,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 16:03:33,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 16:03:33,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 16:03:33,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 16:03:33,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 16:03:33,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 16:03:33,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 16:03:33,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 16:03:33,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 16:03:33,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 16:03:33,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 16:03:33,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 16:03:33,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 16:03:33,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 16:03:33,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 16:03:33,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-08 16:03:33,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 16:03:33,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 16:03:33,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 16:03:33,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 16:03:33,084 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 16:03:33,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 16:03:33,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 16:03:33,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-08 16:03:33,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 16:03:33,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 16:03:33,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 16:03:33,087 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-08 16:03:33,087 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-08 16:03:33,088 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-08 16:03:33,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 16:03:33,088 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-08 16:03:33,088 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-08 16:03:33,088 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-08 16:03:33,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 16:03:33,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 16:03:33,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 16:03:33,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 16:03:33,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 16:03:33,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 16:03:33,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 16:03:33,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 16:03:33,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 16:03:33,091 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-08 16:03:33,091 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-08 16:03:33,092 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 16:03:33,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-08 16:03:33,092 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2019-12-08 16:03:33,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 16:03:33,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 16:03:33,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 16:03:33,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 16:03:33,425 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 16:03:33,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-08 16:03:33,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ac1838/4c160b64068d4bd2b956615ea6002fd0/FLAGcc8dba18f [2019-12-08 16:03:34,035 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 16:03:34,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-08 16:03:34,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ac1838/4c160b64068d4bd2b956615ea6002fd0/FLAGcc8dba18f [2019-12-08 16:03:34,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ac1838/4c160b64068d4bd2b956615ea6002fd0 [2019-12-08 16:03:34,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 16:03:34,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-08 16:03:34,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 16:03:34,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 16:03:34,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 16:03:34,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:34,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6681ac51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34, skipping insertion in model container [2019-12-08 16:03:34,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:34,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 16:03:34,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:03:34,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:03:34,819 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 16:03:34,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:03:34,956 INFO L208 MainTranslator]: Completed translation [2019-12-08 16:03:34,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34 WrapperNode [2019-12-08 16:03:34,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 16:03:34,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 16:03:34,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 16:03:34,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 16:03:34,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:34,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:34,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:34,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:35,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:35,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:35,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (1/1) ... [2019-12-08 16:03:35,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 16:03:35,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 16:03:35,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 16:03:35,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 16:03:35,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (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-12-08 16:03:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-08 16:03:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 16:03:35,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-08 16:03:35,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-08 16:03:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-08 16:03:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-08 16:03:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-08 16:03:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-08 16:03:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-08 16:03:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-08 16:03:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-08 16:03:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-08 16:03:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-08 16:03:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-08 16:03:35,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-08 16:03:35,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-08 16:03:35,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-08 16:03:35,108 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-08 16:03:35,108 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-08 16:03:35,108 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-08 16:03:35,109 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-08 16:03:35,109 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-08 16:03:35,109 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-08 16:03:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-08 16:03:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-08 16:03:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-08 16:03:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-08 16:03:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-08 16:03:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-08 16:03:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-08 16:03:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-08 16:03:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-08 16:03:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-08 16:03:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-08 16:03:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-08 16:03:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-08 16:03:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-08 16:03:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-08 16:03:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-08 16:03:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-08 16:03:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-08 16:03:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-08 16:03:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-08 16:03:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-08 16:03:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-08 16:03:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-08 16:03:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-08 16:03:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-08 16:03:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-08 16:03:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-08 16:03:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-08 16:03:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-08 16:03:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-08 16:03:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-08 16:03:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-08 16:03:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-08 16:03:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-08 16:03:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-08 16:03:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-08 16:03:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-08 16:03:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-08 16:03:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-08 16:03:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-08 16:03:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-08 16:03:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-08 16:03:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-08 16:03:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-08 16:03:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-08 16:03:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-08 16:03:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-08 16:03:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-08 16:03:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-08 16:03:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-08 16:03:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-08 16:03:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-08 16:03:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-08 16:03:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-08 16:03:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-08 16:03:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-08 16:03:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-08 16:03:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-08 16:03:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-08 16:03:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-08 16:03:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-08 16:03:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-08 16:03:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-08 16:03:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-08 16:03:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-08 16:03:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-08 16:03:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-08 16:03:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-08 16:03:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-08 16:03:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-08 16:03:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-08 16:03:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-08 16:03:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-08 16:03:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-08 16:03:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-08 16:03:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-08 16:03:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-08 16:03:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-08 16:03:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-08 16:03:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-08 16:03:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-08 16:03:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-08 16:03:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-08 16:03:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-08 16:03:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-08 16:03:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-08 16:03:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-08 16:03:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-08 16:03:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-08 16:03:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-08 16:03:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-08 16:03:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-08 16:03:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 16:03:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-08 16:03:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 16:03:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-08 16:03:36,169 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 16:03:36,169 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-08 16:03:36,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:03:36 BoogieIcfgContainer [2019-12-08 16:03:36,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 16:03:36,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 16:03:36,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 16:03:36,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 16:03:36,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:03:34" (1/3) ... [2019-12-08 16:03:36,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210bf698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:03:36, skipping insertion in model container [2019-12-08 16:03:36,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:03:34" (2/3) ... [2019-12-08 16:03:36,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210bf698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:03:36, skipping insertion in model container [2019-12-08 16:03:36,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:03:36" (3/3) ... [2019-12-08 16:03:36,182 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2019-12-08 16:03:36,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 16:03:36,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2019-12-08 16:03:36,217 INFO L249 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2019-12-08 16:03:36,241 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 16:03:36,241 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-08 16:03:36,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 16:03:36,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 16:03:36,242 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 16:03:36,242 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 16:03:36,249 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 16:03:36,249 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 16:03:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-08 16:03:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-08 16:03:36,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:36,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:36,280 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:36,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:36,285 INFO L82 PathProgramCache]: Analyzing trace with hash -91005321, now seen corresponding path program 1 times [2019-12-08 16:03:36,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:36,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044046399] [2019-12-08 16:03:36,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:36,462 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-08 16:03:36,468 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:36,530 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-12-08 16:03:36,530 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:36,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:36,538 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:36,538 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-08 16:03:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:36,554 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:36,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044046399] [2019-12-08 16:03:36,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:36,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-08 16:03:36,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867534311] [2019-12-08 16:03:36,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 16:03:36,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:36,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 16:03:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 16:03:36,603 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-12-08 16:03:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:37,006 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-12-08 16:03:37,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 16:03:37,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-08 16:03:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:37,025 INFO L225 Difference]: With dead ends: 139 [2019-12-08 16:03:37,026 INFO L226 Difference]: Without dead ends: 135 [2019-12-08 16:03:37,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-12-08 16:03:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-08 16:03:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2019-12-08 16:03:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-08 16:03:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2019-12-08 16:03:37,119 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 7 [2019-12-08 16:03:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:37,120 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2019-12-08 16:03:37,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 16:03:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2019-12-08 16:03:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-08 16:03:37,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:37,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:37,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-08 16:03:37,336 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash -91005320, now seen corresponding path program 1 times [2019-12-08 16:03:37,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:37,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102241200] [2019-12-08 16:03:37,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:37,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-08 16:03:37,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:37,477 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-12-08 16:03:37,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:37,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:37,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:37,487 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-08 16:03:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:37,499 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:37,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102241200] [2019-12-08 16:03:37,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:37,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-08 16:03:37,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146746820] [2019-12-08 16:03:37,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:03:37,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:03:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:03:37,567 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 4 states. [2019-12-08 16:03:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:38,050 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2019-12-08 16:03:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 16:03:38,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-08 16:03:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:38,055 INFO L225 Difference]: With dead ends: 148 [2019-12-08 16:03:38,055 INFO L226 Difference]: Without dead ends: 148 [2019-12-08 16:03:38,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:03:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-08 16:03:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2019-12-08 16:03:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-08 16:03:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2019-12-08 16:03:38,081 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 7 [2019-12-08 16:03:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:38,082 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2019-12-08 16:03:38,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:03:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2019-12-08 16:03:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-08 16:03:38,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:38,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:38,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-08 16:03:38,298 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -607360533, now seen corresponding path program 1 times [2019-12-08 16:03:38,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:38,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294107677] [2019-12-08 16:03:38,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:38,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-08 16:03:38,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:38,444 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-12-08 16:03:38,444 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:38,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:38,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:38,450 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-08 16:03:38,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:38,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-08 16:03:38,497 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:38,520 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-08 16:03:38,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:03:38,521 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-08 16:03:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:38,536 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:38,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294107677] [2019-12-08 16:03:38,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:38,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-08 16:03:38,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76144714] [2019-12-08 16:03:38,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:03:38,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:38,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:03:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:03:38,587 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 4 states. [2019-12-08 16:03:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:39,043 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2019-12-08 16:03:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:03:39,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-08 16:03:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:39,047 INFO L225 Difference]: With dead ends: 140 [2019-12-08 16:03:39,047 INFO L226 Difference]: Without dead ends: 140 [2019-12-08 16:03:39,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-08 16:03:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2019-12-08 16:03:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-08 16:03:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2019-12-08 16:03:39,057 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 12 [2019-12-08 16:03:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:39,057 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2019-12-08 16:03:39,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:03:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2019-12-08 16:03:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-08 16:03:39,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:39,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:39,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-08 16:03:39,268 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash -607360532, now seen corresponding path program 1 times [2019-12-08 16:03:39,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:39,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330829478] [2019-12-08 16:03:39,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:39,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-08 16:03:39,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:39,413 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-12-08 16:03:39,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:39,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:39,428 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-12-08 16:03:39,429 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:39,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:39,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:39,446 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-08 16:03:39,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:39,501 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-12-08 16:03:39,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:39,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:39,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-08 16:03:39,526 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:39,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:39,540 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:03:39,540 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-08 16:03:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:39,562 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:39,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:39,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330829478] [2019-12-08 16:03:39,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:39,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-08 16:03:39,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315315485] [2019-12-08 16:03:39,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:03:39,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:03:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:03:39,851 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 8 states. [2019-12-08 16:03:41,298 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-08 16:03:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:42,379 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2019-12-08 16:03:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 16:03:42,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-08 16:03:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:42,382 INFO L225 Difference]: With dead ends: 174 [2019-12-08 16:03:42,382 INFO L226 Difference]: Without dead ends: 174 [2019-12-08 16:03:42,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-12-08 16:03:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-08 16:03:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 120. [2019-12-08 16:03:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-08 16:03:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2019-12-08 16:03:42,391 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 12 [2019-12-08 16:03:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:42,391 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2019-12-08 16:03:42,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:03:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2019-12-08 16:03:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:03:42,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:42,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:42,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-08 16:03:42,596 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash 442073730, now seen corresponding path program 1 times [2019-12-08 16:03:42,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:42,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295067466] [2019-12-08 16:03:42,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:42,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-08 16:03:42,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:42,717 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:42,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295067466] [2019-12-08 16:03:42,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:42,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-08 16:03:42,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501482555] [2019-12-08 16:03:42,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:03:42,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:03:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:03:42,729 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 4 states. [2019-12-08 16:03:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:43,039 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2019-12-08 16:03:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 16:03:43,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-08 16:03:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:43,041 INFO L225 Difference]: With dead ends: 145 [2019-12-08 16:03:43,041 INFO L226 Difference]: Without dead ends: 145 [2019-12-08 16:03:43,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-08 16:03:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2019-12-08 16:03:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-08 16:03:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2019-12-08 16:03:43,049 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 14 [2019-12-08 16:03:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:43,049 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2019-12-08 16:03:43,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:03:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2019-12-08 16:03:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:03:43,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:43,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:43,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-08 16:03:43,258 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash 442080590, now seen corresponding path program 1 times [2019-12-08 16:03:43,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:43,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387168868] [2019-12-08 16:03:43,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:43,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-08 16:03:43,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:43,367 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-12-08 16:03:43,367 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:43,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:43,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:43,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-08 16:03:43,383 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-12-08 16:03:43,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:43,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:43,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:43,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-12-08 16:03:43,408 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 19 treesize of output 11 [2019-12-08 16:03:43,409 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:43,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:43,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:43,414 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-12-08 16:03:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:43,421 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:43,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387168868] [2019-12-08 16:03:43,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:43,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-08 16:03:43,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935581457] [2019-12-08 16:03:43,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:03:43,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:03:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:43,436 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 5 states. [2019-12-08 16:03:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:43,966 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2019-12-08 16:03:43,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:03:43,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-08 16:03:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:43,968 INFO L225 Difference]: With dead ends: 168 [2019-12-08 16:03:43,968 INFO L226 Difference]: Without dead ends: 168 [2019-12-08 16:03:43,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:03:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-08 16:03:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 117. [2019-12-08 16:03:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-08 16:03:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-12-08 16:03:43,976 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 14 [2019-12-08 16:03:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:43,977 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-12-08 16:03:43,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:03:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-12-08 16:03:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:03:43,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:43,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:44,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-08 16:03:44,194 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash 442080591, now seen corresponding path program 1 times [2019-12-08 16:03:44,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:44,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854396646] [2019-12-08 16:03:44,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:44,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-08 16:03:44,305 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:44,315 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-12-08 16:03:44,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:44,327 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-08 16:03:44,366 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-12-08 16:03:44,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:44,395 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-12-08 16:03:44,395 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:44,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,409 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2019-12-08 16:03:44,438 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 17 treesize of output 9 [2019-12-08 16:03:44,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:44,453 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 15 treesize of output 7 [2019-12-08 16:03:44,453 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:44,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:44,460 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:11 [2019-12-08 16:03:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:44,472 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:44,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854396646] [2019-12-08 16:03:44,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:44,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-08 16:03:44,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980597337] [2019-12-08 16:03:44,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:03:44,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:03:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:03:44,619 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 8 states. [2019-12-08 16:03:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:45,872 INFO L93 Difference]: Finished difference Result 194 states and 209 transitions. [2019-12-08 16:03:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 16:03:45,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-08 16:03:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:45,875 INFO L225 Difference]: With dead ends: 194 [2019-12-08 16:03:45,875 INFO L226 Difference]: Without dead ends: 194 [2019-12-08 16:03:45,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-08 16:03:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-08 16:03:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 116. [2019-12-08 16:03:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-08 16:03:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2019-12-08 16:03:45,882 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 14 [2019-12-08 16:03:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:45,882 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2019-12-08 16:03:45,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:03:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2019-12-08 16:03:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-08 16:03:45,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:45,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:46,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-08 16:03:46,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1452780850, now seen corresponding path program 1 times [2019-12-08 16:03:46,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:46,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373461833] [2019-12-08 16:03:46,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:46,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-08 16:03:46,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:46,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, 0 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-12-08 16:03:46,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:46,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:46,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:46,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-08 16:03:46,257 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 19 treesize of output 7 [2019-12-08 16:03:46,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:46,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:46,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:46,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-08 16:03:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:46,271 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:46,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373461833] [2019-12-08 16:03:46,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:46,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-08 16:03:46,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994692418] [2019-12-08 16:03:46,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:03:46,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:46,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:03:46,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:03:46,281 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 5 states. [2019-12-08 16:03:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:46,808 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2019-12-08 16:03:46,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:03:46,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-08 16:03:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:46,810 INFO L225 Difference]: With dead ends: 177 [2019-12-08 16:03:46,810 INFO L226 Difference]: Without dead ends: 177 [2019-12-08 16:03:46,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:03:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-08 16:03:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 122. [2019-12-08 16:03:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-08 16:03:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2019-12-08 16:03:46,816 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 17 [2019-12-08 16:03:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:46,817 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2019-12-08 16:03:46,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:03:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2019-12-08 16:03:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-08 16:03:46,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:46,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:47,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-08 16:03:47,020 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash -291956656, now seen corresponding path program 1 times [2019-12-08 16:03:47,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:47,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522183065] [2019-12-08 16:03:47,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:47,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-08 16:03:47,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:47,171 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-12-08 16:03:47,171 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:47,174 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,174 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-08 16:03:47,207 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:47,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-08 16:03:47,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,237 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-08 16:03:47,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-08 16:03:47,260 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 11 treesize of output 7 [2019-12-08 16:03:47,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:47,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-08 16:03:47,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:47,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 59 [2019-12-08 16:03:47,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,403 INFO L614 ElimStorePlain]: treesize reduction 28, result has 55.6 percent of original size [2019-12-08 16:03:47,405 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:03:47,406 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2019-12-08 16:03:47,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:47,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-12-08 16:03:47,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:47,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:47,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:03:47,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:17 [2019-12-08 16:03:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:47,545 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:47,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522183065] [2019-12-08 16:03:47,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:47,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-12-08 16:03:47,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312263201] [2019-12-08 16:03:47,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-08 16:03:47,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-08 16:03:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-08 16:03:47,665 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 14 states. [2019-12-08 16:03:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:03:49,302 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2019-12-08 16:03:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-08 16:03:49,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-08 16:03:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:03:49,304 INFO L225 Difference]: With dead ends: 187 [2019-12-08 16:03:49,304 INFO L226 Difference]: Without dead ends: 187 [2019-12-08 16:03:49,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2019-12-08 16:03:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-08 16:03:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-12-08 16:03:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-08 16:03:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2019-12-08 16:03:49,309 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 18 [2019-12-08 16:03:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:03:49,309 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2019-12-08 16:03:49,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-08 16:03:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2019-12-08 16:03:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-08 16:03:49,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:03:49,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:03:49,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-08 16:03:49,520 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:03:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:03:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash -291956655, now seen corresponding path program 1 times [2019-12-08 16:03:49,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:03:49,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301614409] [2019-12-08 16:03:49,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-08 16:03:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:03:49,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-08 16:03:49,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:03:49,635 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-12-08 16:03:49,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,637 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-08 16:03:49,656 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_75|], 1=[|v_#valid_122|]} [2019-12-08 16:03:49,660 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-12-08 16:03:49,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,687 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-12-08 16:03:49,687 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,696 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-12-08 16:03:49,721 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 11 treesize of output 7 [2019-12-08 16:03:49,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,741 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 11 treesize of output 7 [2019-12-08 16:03:49,742 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,753 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,754 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,754 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:25 [2019-12-08 16:03:49,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-08 16:03:49,814 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 29 treesize of output 24 [2019-12-08 16:03:49,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:49,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,875 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:49,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2019-12-08 16:03:49,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-08 16:03:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:49,879 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-08 16:03:49,941 INFO L614 ElimStorePlain]: treesize reduction 52, result has 49.5 percent of original size [2019-12-08 16:03:49,942 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:03:49,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2019-12-08 16:03:50,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:50,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2019-12-08 16:03:50,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:50,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:50,063 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 24 treesize of output 10 [2019-12-08 16:03:50,063 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:50,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:50,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:03:50,071 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:9 [2019-12-08 16:03:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:50,106 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:03:52,425 WARN L192 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-08 16:03:54,793 WARN L192 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-08 16:03:54,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:55,016 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-08 16:03:55,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:55,026 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:55,954 WARN L192 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-08 16:03:55,955 INFO L614 ElimStorePlain]: treesize reduction 59, result has 54.3 percent of original size [2019-12-08 16:03:55,962 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-08 16:03:56,092 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-08 16:03:56,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:03:56,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-08 16:03:56,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:56,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:56,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:56,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-12-08 16:03:56,117 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:133, output treesize:46 [2019-12-08 16:03:56,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-08 16:03:56,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:56,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:56,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:03:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:03:56,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301614409] [2019-12-08 16:03:56,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:03:56,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-12-08 16:03:56,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769349389] [2019-12-08 16:03:56,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-08 16:03:56,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:03:56,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-08 16:03:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-08 16:03:56,274 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 16 states. [2019-12-08 16:03:57,731 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-12-08 16:03:58,059 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-08 16:04:01,163 WARN L192 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-08 16:04:03,294 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-08 16:04:04,167 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-12-08 16:04:04,603 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-08 16:04:05,966 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-08 16:04:07,425 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-08 16:04:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:04:08,529 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-12-08 16:04:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-08 16:04:08,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-08 16:04:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:04:08,532 INFO L225 Difference]: With dead ends: 142 [2019-12-08 16:04:08,532 INFO L226 Difference]: Without dead ends: 142 [2019-12-08 16:04:08,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2019-12-08 16:04:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-08 16:04:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2019-12-08 16:04:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-08 16:04:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2019-12-08 16:04:08,536 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 18 [2019-12-08 16:04:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:04:08,536 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2019-12-08 16:04:08,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-08 16:04:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2019-12-08 16:04:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-08 16:04:08,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:04:08,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:04:08,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-08 16:04:08,743 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:04:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:04:08,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1033761575, now seen corresponding path program 1 times [2019-12-08 16:04:08,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:04:08,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336977295] [2019-12-08 16:04:08,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-08 16:04:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:04:08,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-08 16:04:08,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:04:08,840 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 13 treesize of output 9 [2019-12-08 16:04:08,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:04:08,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:04:08,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:04:08,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-08 16:04:08,861 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 19 treesize of output 7 [2019-12-08 16:04:08,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:04:08,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:04:08,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:04:08,864 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-08 16:04:08,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-12-08 16:04:08,874 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:04:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:04:08,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336977295] [2019-12-08 16:04:08,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:04:08,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-08 16:04:08,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215487341] [2019-12-08 16:04:08,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:04:08,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:04:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:04:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:04:08,961 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 8 states. [2019-12-08 16:04:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:04:09,828 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2019-12-08 16:04:09,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:04:09,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-08 16:04:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:04:09,830 INFO L225 Difference]: With dead ends: 171 [2019-12-08 16:04:09,830 INFO L226 Difference]: Without dead ends: 171 [2019-12-08 16:04:09,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:04:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-08 16:04:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 122. [2019-12-08 16:04:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-08 16:04:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2019-12-08 16:04:09,834 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 23 [2019-12-08 16:04:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:04:09,834 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2019-12-08 16:04:09,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:04:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2019-12-08 16:04:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-08 16:04:09,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:04:09,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:04:10,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-08 16:04:10,042 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-08 16:04:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:04:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1033450693, now seen corresponding path program 1 times [2019-12-08 16:04:10,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:04:10,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403657091] [2019-12-08 16:04:10,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-08 16:04:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 16:04:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 16:04:10,193 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-08 16:04:10,194 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-08 16:04:10,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-08 16:04:10,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:04:10 BoogieIcfgContainer [2019-12-08 16:04:10,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 16:04:10,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 16:04:10,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 16:04:10,439 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 16:04:10,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:03:36" (3/4) ... [2019-12-08 16:04:10,444 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-08 16:04:10,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 16:04:10,448 INFO L168 Benchmark]: Toolchain (without parser) took 36128.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 157.4 MB. Max. memory is 11.5 GB. [2019-12-08 16:04:10,448 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:04:10,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-08 16:04:10,449 INFO L168 Benchmark]: Boogie Preprocessor took 85.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:04:10,449 INFO L168 Benchmark]: RCFGBuilder took 1127.13 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: 71.6 MB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. [2019-12-08 16:04:10,450 INFO L168 Benchmark]: TraceAbstraction took 34265.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 11.5 GB. [2019-12-08 16:04:10,450 INFO L168 Benchmark]: Witness Printer took 5.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:04:10,456 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 639.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1127.13 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: 71.6 MB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34265.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.91 ms. Allocated memory is still 1.3 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: - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1040. Possible FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={1:0}, malloc(sizeof(SLL))={1:0}] [L995] list->next = ((void*)0) VAL [list={1:0}, malloc(sizeof(SLL))={1:0}] [L996] list->prev = ((void*)0) VAL [list={1:0}, malloc(sizeof(SLL))={1:0}] [L997] list->colour = BLACK VAL [list={1:0}, malloc(sizeof(SLL))={1:0}] [L999] SLL* end = list; VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1030] EXPR end->colour VAL [end={1:0}, end->colour=1, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1034] EXPR end->colour VAL [end={1:0}, end->colour=1, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={1:0}, end->next={0:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 145 locations, 65 error locations. Result: UNSAFE, OverallTime: 34.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 862 SDtfs, 1678 SDslu, 1768 SDs, 0 SdLazy, 2770 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 236 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 436 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 290 ConstructedInterpolants, 16 QuantifiedInterpolants, 29950 SizeOfPredicates, 70 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...