./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/sll-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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:40:40,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:40:40,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:40:40,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:40:40,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:40:40,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:40:40,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:40:40,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:40:40,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:40:40,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:40:40,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:40:40,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:40:40,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:40:40,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:40:40,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:40:40,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:40:40,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:40:40,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:40:40,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:40:40,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:40:40,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:40:40,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:40:40,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:40:40,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:40:40,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:40:40,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:40:40,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:40:40,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:40:40,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:40:40,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:40:40,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:40:40,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:40:40,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:40:40,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:40:40,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:40:40,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:40:40,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:40:40,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:40:40,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:40:40,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:40:40,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:40:40,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 16:40:40,953 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:40:40,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:40:40,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:40:40,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:40:40,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:40:40,955 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:40:40,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:40:40,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:40:40,955 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:40:40,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:40:40,956 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:40:40,956 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:40:40,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:40:40,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:40:40,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:40:40,956 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:40:40,957 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:40:40,957 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:40:40,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:40:40,957 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:40:40,957 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:40:40,957 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:40:40,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:40:40,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:40:40,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:40:40,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:40:40,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:40:40,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:40:40,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:40:40,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:40:40,958 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:40:40,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2021-12-22 16:40:41,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:40:41,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:40:41,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:40:41,161 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:40:41,161 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:40:41,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 16:40:41,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7158213b7/68dad16de41d4b8e83a88bb08f9d903d/FLAGe9cf1e38d [2021-12-22 16:40:41,626 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:40:41,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 16:40:41,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7158213b7/68dad16de41d4b8e83a88bb08f9d903d/FLAGe9cf1e38d [2021-12-22 16:40:41,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7158213b7/68dad16de41d4b8e83a88bb08f9d903d [2021-12-22 16:40:41,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:40:41,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:40:41,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:40:41,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:40:41,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:40:41,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:40:41" (1/1) ... [2021-12-22 16:40:41,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2782db5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:41, skipping insertion in model container [2021-12-22 16:40:41,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:40:41" (1/1) ... [2021-12-22 16:40:41,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:40:41,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:40:41,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 16:40:41,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 16:40:41,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 16:40:41,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:40:41,999 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:40:42,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 16:40:42,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 16:40:42,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 16:40:42,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:40:42,049 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:40:42,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42 WrapperNode [2021-12-22 16:40:42,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:40:42,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:40:42,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:40:42,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:40:42,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,083 INFO L137 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-12-22 16:40:42,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:40:42,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:40:42,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:40:42,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:40:42,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:40:42,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:40:42,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:40:42,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:40:42,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:40:42,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:42,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:40:42,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 16:40:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:40:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:40:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:40:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:40:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:40:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:40:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:40:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:40:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:40:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:40:42,260 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:40:42,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:40:42,556 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:40:42,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:40:42,561 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-22 16:40:42,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:42 BoogieIcfgContainer [2021-12-22 16:40:42,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:40:42,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:40:42,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:40:42,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:40:42,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:40:41" (1/3) ... [2021-12-22 16:40:42,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a492935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:40:42, skipping insertion in model container [2021-12-22 16:40:42,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (2/3) ... [2021-12-22 16:40:42,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a492935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:40:42, skipping insertion in model container [2021-12-22 16:40:42,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:42" (3/3) ... [2021-12-22 16:40:42,568 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2021-12-22 16:40:42,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:40:42,580 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2021-12-22 16:40:42,622 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:40:42,627 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:40:42,627 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2021-12-22 16:40:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 65 states have (on average 2.123076923076923) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:40:42,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:42,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:40:42,644 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:40:42,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:42,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053217416] [2021-12-22 16:40:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:42,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:42,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:42,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053217416] [2021-12-22 16:40:42,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053217416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:42,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:42,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:40:42,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412662528] [2021-12-22 16:40:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:42,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:40:42,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:40:42,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:42,836 INFO L87 Difference]: Start difference. First operand has 121 states, 65 states have (on average 2.123076923076923) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:42,943 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-22 16:40:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:40:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:40:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:42,951 INFO L225 Difference]: With dead ends: 123 [2021-12-22 16:40:42,951 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 16:40:42,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:42,955 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:42,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 73 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 16:40:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-22 16:40:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 114 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2021-12-22 16:40:42,981 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 3 [2021-12-22 16:40:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:42,981 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2021-12-22 16:40:42,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2021-12-22 16:40:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:40:42,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:42,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:40:42,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:40:42,983 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:40:42,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:42,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890437728] [2021-12-22 16:40:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:42,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890437728] [2021-12-22 16:40:43,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890437728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:40:43,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262354028] [2021-12-22 16:40:43,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:40:43,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:40:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:43,018 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,092 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-22 16:40:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:40:43,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:40:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,094 INFO L225 Difference]: With dead ends: 133 [2021-12-22 16:40:43,094 INFO L226 Difference]: Without dead ends: 133 [2021-12-22 16:40:43,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:43,095 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 78 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-22 16:40:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2021-12-22 16:40:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2021-12-22 16:40:43,102 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2021-12-22 16:40:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,102 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2021-12-22 16:40:43,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2021-12-22 16:40:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:40:43,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:40:43,104 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-22 16:40:43,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119870954] [2021-12-22 16:40:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119870954] [2021-12-22 16:40:43,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119870954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:40:43,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672855822] [2021-12-22 16:40:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:43,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:43,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:43,203 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,322 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-22 16:40:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:40:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 16:40:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,324 INFO L225 Difference]: With dead ends: 127 [2021-12-22 16:40:43,324 INFO L226 Difference]: Without dead ends: 127 [2021-12-22 16:40:43,324 INFO L932 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 [2021-12-22 16:40:43,325 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 161 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 61 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-22 16:40:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2021-12-22 16:40:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.605263157894737) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2021-12-22 16:40:43,330 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 8 [2021-12-22 16:40:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,331 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2021-12-22 16:40:43,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2021-12-22 16:40:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:40:43,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:40:43,332 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-22 16:40:43,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333961566] [2021-12-22 16:40:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333961566] [2021-12-22 16:40:43,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333961566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:43,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379492446] [2021-12-22 16:40:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:43,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:43,423 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,635 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-12-22 16:40:43,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:40:43,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 16:40:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,636 INFO L225 Difference]: With dead ends: 151 [2021-12-22 16:40:43,636 INFO L226 Difference]: Without dead ends: 151 [2021-12-22 16:40:43,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:40:43,638 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 152 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-22 16:40:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2021-12-22 16:40:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 121 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2021-12-22 16:40:43,643 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 8 [2021-12-22 16:40:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,643 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2021-12-22 16:40:43,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2021-12-22 16:40:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:40:43,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:40:43,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:43,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1117785369, now seen corresponding path program 1 times [2021-12-22 16:40:43,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920857077] [2021-12-22 16:40:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920857077] [2021-12-22 16:40:43,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920857077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:40:43,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548485583] [2021-12-22 16:40:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:43,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:43,678 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,783 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2021-12-22 16:40:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:40:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 16:40:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,784 INFO L225 Difference]: With dead ends: 136 [2021-12-22 16:40:43,784 INFO L226 Difference]: Without dead ends: 136 [2021-12-22 16:40:43,785 INFO L932 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 [2021-12-22 16:40:43,785 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 121 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 130 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-22 16:40:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2021-12-22 16:40:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-22 16:40:43,790 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 10 [2021-12-22 16:40:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,790 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-22 16:40:43,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-22 16:40:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:40:43,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:40:43,791 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-22 16:40:43,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425312691] [2021-12-22 16:40:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425312691] [2021-12-22 16:40:43,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425312691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:43,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510903210] [2021-12-22 16:40:43,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:43,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:43,841 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,974 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2021-12-22 16:40:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:40:43,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 16:40:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,975 INFO L225 Difference]: With dead ends: 121 [2021-12-22 16:40:43,975 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 16:40:43,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:40:43,976 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 240 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 16:40:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-12-22 16:40:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.5) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-12-22 16:40:43,980 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 12 [2021-12-22 16:40:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,980 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-12-22 16:40:43,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-12-22 16:40:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:40:43,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:40:43,981 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:43,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-22 16:40:43,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402943475] [2021-12-22 16:40:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:44,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:44,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402943475] [2021-12-22 16:40:44,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402943475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:44,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:44,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:44,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092799506] [2021-12-22 16:40:44,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:44,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:44,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:44,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:44,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:44,103 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:44,327 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-22 16:40:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:40:44,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 16:40:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:44,328 INFO L225 Difference]: With dead ends: 121 [2021-12-22 16:40:44,329 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 16:40:44,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:40:44,329 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:44,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 276 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 16:40:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2021-12-22 16:40:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2021-12-22 16:40:44,332 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 12 [2021-12-22 16:40:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:44,332 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2021-12-22 16:40:44,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2021-12-22 16:40:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:40:44,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:44,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:44,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:40:44,333 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1066467192, now seen corresponding path program 1 times [2021-12-22 16:40:44,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:44,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26342517] [2021-12-22 16:40:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:44,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:44,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:44,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26342517] [2021-12-22 16:40:44,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26342517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:44,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:44,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:40:44,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070850803] [2021-12-22 16:40:44,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:44,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:44,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:44,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:44,425 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:44,591 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2021-12-22 16:40:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:40:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 16:40:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:44,592 INFO L225 Difference]: With dead ends: 177 [2021-12-22 16:40:44,592 INFO L226 Difference]: Without dead ends: 177 [2021-12-22 16:40:44,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:40:44,593 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 160 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:44,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 235 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-22 16:40:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2021-12-22 16:40:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-12-22 16:40:44,596 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 13 [2021-12-22 16:40:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:44,596 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-12-22 16:40:44,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-12-22 16:40:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:40:44,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:44,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:44,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:40:44,596 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:44,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1154665855, now seen corresponding path program 1 times [2021-12-22 16:40:44,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:44,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264670797] [2021-12-22 16:40:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:44,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:44,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264670797] [2021-12-22 16:40:44,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264670797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:44,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:44,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:44,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136252598] [2021-12-22 16:40:44,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:44,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:40:44,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:44,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:40:44,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:44,656 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:44,744 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-12-22 16:40:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:40:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 16:40:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:44,745 INFO L225 Difference]: With dead ends: 127 [2021-12-22 16:40:44,745 INFO L226 Difference]: Without dead ends: 127 [2021-12-22 16:40:44,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:44,746 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 14 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:44,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 266 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-22 16:40:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2021-12-22 16:40:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-22 16:40:44,748 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 19 [2021-12-22 16:40:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:44,749 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-22 16:40:44,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-22 16:40:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:40:44,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:44,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:44,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:40:44,750 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1154976737, now seen corresponding path program 1 times [2021-12-22 16:40:44,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:44,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514805524] [2021-12-22 16:40:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:44,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:40:44,759 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 16:40:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:40:44,775 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 16:40:44,775 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 16:40:44,776 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2021-12-22 16:40:44,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (53 of 55 remaining) [2021-12-22 16:40:44,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (52 of 55 remaining) [2021-12-22 16:40:44,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (51 of 55 remaining) [2021-12-22 16:40:44,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (50 of 55 remaining) [2021-12-22 16:40:44,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (49 of 55 remaining) [2021-12-22 16:40:44,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (48 of 55 remaining) [2021-12-22 16:40:44,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (47 of 55 remaining) [2021-12-22 16:40:44,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (46 of 55 remaining) [2021-12-22 16:40:44,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (45 of 55 remaining) [2021-12-22 16:40:44,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (44 of 55 remaining) [2021-12-22 16:40:44,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (43 of 55 remaining) [2021-12-22 16:40:44,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (42 of 55 remaining) [2021-12-22 16:40:44,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (41 of 55 remaining) [2021-12-22 16:40:44,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (40 of 55 remaining) [2021-12-22 16:40:44,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (39 of 55 remaining) [2021-12-22 16:40:44,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (38 of 55 remaining) [2021-12-22 16:40:44,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (37 of 55 remaining) [2021-12-22 16:40:44,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (36 of 55 remaining) [2021-12-22 16:40:44,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (35 of 55 remaining) [2021-12-22 16:40:44,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (34 of 55 remaining) [2021-12-22 16:40:44,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (33 of 55 remaining) [2021-12-22 16:40:44,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (32 of 55 remaining) [2021-12-22 16:40:44,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2021-12-22 16:40:44,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (30 of 55 remaining) [2021-12-22 16:40:44,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (29 of 55 remaining) [2021-12-22 16:40:44,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2021-12-22 16:40:44,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (27 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (26 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (25 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (24 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 55 remaining) [2021-12-22 16:40:44,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (19 of 55 remaining) [2021-12-22 16:40:44,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (18 of 55 remaining) [2021-12-22 16:40:44,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (17 of 55 remaining) [2021-12-22 16:40:44,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (16 of 55 remaining) [2021-12-22 16:40:44,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (15 of 55 remaining) [2021-12-22 16:40:44,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (14 of 55 remaining) [2021-12-22 16:40:44,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2021-12-22 16:40:44,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (10 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (9 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (5 of 55 remaining) [2021-12-22 16:40:44,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (4 of 55 remaining) [2021-12-22 16:40:44,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2021-12-22 16:40:44,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2021-12-22 16:40:44,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2021-12-22 16:40:44,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2021-12-22 16:40:44,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:40:44,788 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:44,790 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 16:40:44,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:40:44 BoogieIcfgContainer [2021-12-22 16:40:44,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 16:40:44,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 16:40:44,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 16:40:44,806 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 16:40:44,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:42" (3/4) ... [2021-12-22 16:40:44,809 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 16:40:44,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 16:40:44,809 INFO L158 Benchmark]: Toolchain (without parser) took 3162.36ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 67.1MB in the beginning and 61.7MB in the end (delta: 5.4MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2021-12-22 16:40:44,809 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 77.6MB. Free memory was 38.0MB in the beginning and 37.9MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:40:44,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.65ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 66.1MB in the end (delta: 730.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 16:40:44,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:40:44,810 INFO L158 Benchmark]: Boogie Preprocessor took 41.23ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 62.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:40:44,810 INFO L158 Benchmark]: RCFGBuilder took 436.41ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 43.9MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-22 16:40:44,813 INFO L158 Benchmark]: TraceAbstraction took 2241.73ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 43.1MB in the beginning and 61.7MB in the end (delta: -18.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 16:40:44,814 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 117.4MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:40:44,815 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 77.6MB. Free memory was 38.0MB in the beginning and 37.9MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.65ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 66.1MB in the end (delta: 730.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.23ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 62.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.41ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 43.9MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2241.73ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 43.1MB in the beginning and 61.7MB in the end (delta: -18.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 117.4MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK VAL [list={-1:0}] [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1043] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 121 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 1474 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 848 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1369 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 626 mSDtfsCounter, 1369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=4, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 149 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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 [2021-12-22 16:40:44,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/sll-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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:40:46,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:40:46,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:40:46,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:40:46,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:40:46,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:40:46,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:40:46,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:40:46,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:40:46,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:40:46,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:40:46,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:40:46,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:40:46,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:40:46,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:40:46,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:40:46,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:40:46,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:40:46,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:40:46,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:40:46,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:40:46,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:40:46,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:40:46,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:40:46,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:40:46,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:40:46,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:40:46,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:40:46,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:40:46,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:40:46,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:40:46,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:40:46,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:40:46,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:40:46,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:40:46,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:40:46,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:40:46,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:40:46,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:40:46,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:40:46,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:40:46,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-22 16:40:46,683 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:40:46,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:40:46,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:40:46,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:40:46,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:40:46,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:40:46,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:40:46,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:40:46,687 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:40:46,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:40:46,688 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:40:46,688 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:40:46,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:40:46,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:40:46,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:40:46,688 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:40:46,689 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:40:46,689 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:40:46,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:40:46,689 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:40:46,689 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 16:40:46,689 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 16:40:46,689 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:40:46,690 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:40:46,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:40:46,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:40:46,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:40:46,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:40:46,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:40:46,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:40:46,691 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 16:40:46,691 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 16:40:46,691 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:40:46,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 16:40:46,692 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2021-12-22 16:40:46,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:40:46,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:40:46,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:40:46,979 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:40:46,980 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:40:46,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 16:40:47,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa0e4049/6b3bee7b05cd4aae92a64739cb8d7ca7/FLAGb4a24c468 [2021-12-22 16:40:47,440 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:40:47,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 16:40:47,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa0e4049/6b3bee7b05cd4aae92a64739cb8d7ca7/FLAGb4a24c468 [2021-12-22 16:40:47,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa0e4049/6b3bee7b05cd4aae92a64739cb8d7ca7 [2021-12-22 16:40:47,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:40:47,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:40:47,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:40:47,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:40:47,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:40:47,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:40:47" (1/1) ... [2021-12-22 16:40:47,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5371f388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:47, skipping insertion in model container [2021-12-22 16:40:47,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:40:47" (1/1) ... [2021-12-22 16:40:47,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:40:47,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:40:48,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 16:40:48,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 16:40:48,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 16:40:48,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:40:48,212 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:40:48,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 16:40:48,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 16:40:48,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 16:40:48,243 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:40:48,262 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:40:48,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48 WrapperNode [2021-12-22 16:40:48,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:40:48,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:40:48,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:40:48,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:40:48,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,299 INFO L137 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2021-12-22 16:40:48,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:40:48,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:40:48,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:40:48,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:40:48,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:40:48,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:40:48,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:40:48,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:40:48,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (1/1) ... [2021-12-22 16:40:48,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:40:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:48,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:40:48,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 16:40:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-22 16:40:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:40:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:40:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:40:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:40:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:40:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-22 16:40:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-22 16:40:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:40:48,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:40:48,554 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:40:48,555 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:40:48,982 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:40:48,987 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:40:48,988 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-22 16:40:48,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:48 BoogieIcfgContainer [2021-12-22 16:40:48,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:40:48,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:40:48,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:40:48,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:40:48,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:40:47" (1/3) ... [2021-12-22 16:40:48,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7518c3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:40:48, skipping insertion in model container [2021-12-22 16:40:48,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:48" (2/3) ... [2021-12-22 16:40:48,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7518c3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:40:48, skipping insertion in model container [2021-12-22 16:40:48,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:48" (3/3) ... [2021-12-22 16:40:48,995 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2021-12-22 16:40:48,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:40:48,999 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2021-12-22 16:40:49,036 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:40:49,043 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:40:49,043 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2021-12-22 16:40:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:40:49,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:49,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:40:49,076 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:40:49,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:49,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416035273] [2021-12-22 16:40:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:49,090 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:49,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:49,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-22 16:40:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:49,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 16:40:49,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:49,219 INFO L387 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 [2021-12-22 16:40:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:49,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:49,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:49,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416035273] [2021-12-22 16:40:49,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416035273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:49,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:49,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:40:49,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445652913] [2021-12-22 16:40:49,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:49,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:40:49,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:40:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:49,252 INFO L87 Difference]: Start difference. First operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:49,436 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-22 16:40:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:40:49,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:40:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:49,444 INFO L225 Difference]: With dead ends: 121 [2021-12-22 16:40:49,444 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 16:40:49,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:49,448 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:49,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 71 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 16:40:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2021-12-22 16:40:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.875) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-22 16:40:49,472 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 3 [2021-12-22 16:40:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:49,472 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-22 16:40:49,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-22 16:40:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:40:49,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:49,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:40:49,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:49,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:49,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:49,681 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:40:49,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:49,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424066733] [2021-12-22 16:40:49,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:49,682 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:49,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:49,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:49,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-22 16:40:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:49,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 16:40:49,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:49,732 INFO L387 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 [2021-12-22 16:40:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:49,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:49,741 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:49,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424066733] [2021-12-22 16:40:49,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424066733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:49,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:49,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:40:49,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133773747] [2021-12-22 16:40:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:49,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:40:49,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:40:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:49,744 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:49,896 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2021-12-22 16:40:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:40:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:40:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:49,897 INFO L225 Difference]: With dead ends: 131 [2021-12-22 16:40:49,897 INFO L226 Difference]: Without dead ends: 131 [2021-12-22 16:40:49,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:49,899 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:49,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-22 16:40:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-12-22 16:40:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 117 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-12-22 16:40:49,905 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 3 [2021-12-22 16:40:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:49,905 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-12-22 16:40:49,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-12-22 16:40:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 16:40:49,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:49,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:49,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:50,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:50,113 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-22 16:40:50,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:50,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484794101] [2021-12-22 16:40:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:50,114 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:50,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:50,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:50,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-22 16:40:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:50,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 16:40:50,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:50,198 INFO L387 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 [2021-12-22 16:40:50,245 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-22 16:40:50,245 INFO L387 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 17 [2021-12-22 16:40:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:50,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:50,256 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:50,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484794101] [2021-12-22 16:40:50,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484794101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:50,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:50,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:40:50,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304260773] [2021-12-22 16:40:50,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:50,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:50,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:50,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:50,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:50,258 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:50,468 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-22 16:40:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:40:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-22 16:40:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:50,470 INFO L225 Difference]: With dead ends: 125 [2021-12-22 16:40:50,470 INFO L226 Difference]: Without dead ends: 125 [2021-12-22 16:40:50,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:50,471 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 158 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:50,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 59 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-22 16:40:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2021-12-22 16:40:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-22 16:40:50,478 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 7 [2021-12-22 16:40:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:50,478 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-22 16:40:50,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-22 16:40:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 16:40:50,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:50,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:50,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:50,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:50,681 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-22 16:40:50,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:50,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275009441] [2021-12-22 16:40:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:50,682 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:50,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:50,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:50,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-22 16:40:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:50,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 16:40:50,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:50,810 INFO L387 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 [2021-12-22 16:40:50,860 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:40:50,860 INFO L387 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 14 [2021-12-22 16:40:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:50,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:50,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:50,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275009441] [2021-12-22 16:40:50,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275009441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:50,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:50,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:40:50,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002174152] [2021-12-22 16:40:50,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:50,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:50,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:50,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:50,873 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:51,143 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2021-12-22 16:40:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:40:51,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-22 16:40:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:51,145 INFO L225 Difference]: With dead ends: 148 [2021-12-22 16:40:51,145 INFO L226 Difference]: Without dead ends: 148 [2021-12-22 16:40:51,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:51,146 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 147 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:51,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 85 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:40:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-22 16:40:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-12-22 16:40:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2021-12-22 16:40:51,151 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 7 [2021-12-22 16:40:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:51,152 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2021-12-22 16:40:51,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2021-12-22 16:40:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 16:40:51,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:51,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:51,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-22 16:40:51,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:51,382 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1837273936, now seen corresponding path program 1 times [2021-12-22 16:40:51,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:51,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435434111] [2021-12-22 16:40:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:51,383 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:51,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:51,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-22 16:40:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:51,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 16:40:51,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:51,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:51,452 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435434111] [2021-12-22 16:40:51,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435434111] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:51,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:51,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:40:51,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680219908] [2021-12-22 16:40:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:51,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:51,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:51,454 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:51,624 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2021-12-22 16:40:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:40:51,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-22 16:40:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:51,625 INFO L225 Difference]: With dead ends: 133 [2021-12-22 16:40:51,625 INFO L226 Difference]: Without dead ends: 133 [2021-12-22 16:40:51,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:51,626 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 119 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:51,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 126 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-22 16:40:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2021-12-22 16:40:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2021-12-22 16:40:51,630 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 9 [2021-12-22 16:40:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:51,631 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2021-12-22 16:40:51,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2021-12-22 16:40:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:40:51,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:51,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:51,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:51,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:51,841 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:51,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-22 16:40:51,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:51,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821074655] [2021-12-22 16:40:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:51,842 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:51,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:51,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-22 16:40:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:51,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 16:40:51,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:51,915 INFO L387 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 [2021-12-22 16:40:51,945 INFO L387 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 [2021-12-22 16:40:51,978 INFO L387 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 [2021-12-22 16:40:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:51,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:51,992 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:51,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821074655] [2021-12-22 16:40:51,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821074655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:51,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:51,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:51,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790340938] [2021-12-22 16:40:51,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:51,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:51,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:51,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:51,994 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:52,494 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-12-22 16:40:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:40:52,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:40:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:52,495 INFO L225 Difference]: With dead ends: 118 [2021-12-22 16:40:52,496 INFO L226 Difference]: Without dead ends: 118 [2021-12-22 16:40:52,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:40:52,498 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:52,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 227 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:40:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-22 16:40:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2021-12-22 16:40:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 115 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2021-12-22 16:40:52,508 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 11 [2021-12-22 16:40:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:52,508 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2021-12-22 16:40:52,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2021-12-22 16:40:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:40:52,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:52,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:52,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:52,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:52,716 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-22 16:40:52,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:52,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346626579] [2021-12-22 16:40:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:52,717 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:52,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:52,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:52,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-22 16:40:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:52,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 16:40:52,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:52,781 INFO L387 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 [2021-12-22 16:40:52,824 INFO L387 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 [2021-12-22 16:40:52,829 INFO L387 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 [2021-12-22 16:40:52,866 INFO L387 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 [2021-12-22 16:40:52,870 INFO L387 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 [2021-12-22 16:40:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:52,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:52,894 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:52,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346626579] [2021-12-22 16:40:52,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346626579] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:52,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:52,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:52,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656302605] [2021-12-22 16:40:52,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:52,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:52,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:52,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:52,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:52,895 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:53,244 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2021-12-22 16:40:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:40:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:40:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:53,245 INFO L225 Difference]: With dead ends: 117 [2021-12-22 16:40:53,245 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 16:40:53,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:40:53,246 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:53,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 263 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:40:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 16:40:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2021-12-22 16:40:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-12-22 16:40:53,250 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 11 [2021-12-22 16:40:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:53,250 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-12-22 16:40:53,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-12-22 16:40:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:40:53,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:53,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:53,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:53,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:53,459 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:53,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash -831409633, now seen corresponding path program 1 times [2021-12-22 16:40:53,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:53,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540255243] [2021-12-22 16:40:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:53,460 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:53,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:53,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-22 16:40:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:53,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 16:40:53,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:53,524 INFO L387 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 [2021-12-22 16:40:53,558 INFO L387 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 [2021-12-22 16:40:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:53,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:53,568 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:53,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540255243] [2021-12-22 16:40:53,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540255243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:53,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:53,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:53,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585096097] [2021-12-22 16:40:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:53,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:40:53,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:40:53,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:53,570 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:53,827 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2021-12-22 16:40:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:40:53,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 16:40:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:53,829 INFO L225 Difference]: With dead ends: 173 [2021-12-22 16:40:53,829 INFO L226 Difference]: Without dead ends: 173 [2021-12-22 16:40:53,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:40:53,829 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 81 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:53,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 217 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-22 16:40:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2021-12-22 16:40:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 116 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2021-12-22 16:40:53,833 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2021-12-22 16:40:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:53,833 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2021-12-22 16:40:53,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2021-12-22 16:40:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:40:53,834 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:53,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:53,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:54,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:54,035 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1081092570, now seen corresponding path program 1 times [2021-12-22 16:40:54,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:54,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681814692] [2021-12-22 16:40:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:54,036 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:54,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:54,037 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:54,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-22 16:40:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:54,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 16:40:54,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:54,106 INFO L387 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 [2021-12-22 16:40:54,146 INFO L387 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 [2021-12-22 16:40:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:54,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:40:54,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:40:54,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681814692] [2021-12-22 16:40:54,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681814692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:54,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:54,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:54,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254369457] [2021-12-22 16:40:54,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:54,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:40:54,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:40:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:40:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:54,157 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:54,378 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2021-12-22 16:40:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:40:54,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 16:40:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:54,379 INFO L225 Difference]: With dead ends: 171 [2021-12-22 16:40:54,379 INFO L226 Difference]: Without dead ends: 171 [2021-12-22 16:40:54,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:40:54,380 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 72 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:54,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 219 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-22 16:40:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2021-12-22 16:40:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-12-22 16:40:54,382 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 18 [2021-12-22 16:40:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:54,383 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-12-22 16:40:54,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-12-22 16:40:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:40:54,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:54,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:54,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:54,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:54,584 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 16:40:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1080781688, now seen corresponding path program 1 times [2021-12-22 16:40:54,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:40:54,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097271121] [2021-12-22 16:40:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:54,584 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:40:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:40:54,600 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:40:54,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-22 16:40:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:40:54,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 16:40:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:40:54,715 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-22 16:40:54,715 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 16:40:54,716 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2021-12-22 16:40:54,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (53 of 55 remaining) [2021-12-22 16:40:54,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (52 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (51 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (50 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (49 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (48 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (47 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (46 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (45 of 55 remaining) [2021-12-22 16:40:54,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (44 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (43 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (42 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (41 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (40 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (39 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (38 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (37 of 55 remaining) [2021-12-22 16:40:54,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (36 of 55 remaining) [2021-12-22 16:40:54,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (35 of 55 remaining) [2021-12-22 16:40:54,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (34 of 55 remaining) [2021-12-22 16:40:54,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (33 of 55 remaining) [2021-12-22 16:40:54,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (32 of 55 remaining) [2021-12-22 16:40:54,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2021-12-22 16:40:54,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (30 of 55 remaining) [2021-12-22 16:40:54,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (29 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (27 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (26 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (25 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (24 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 55 remaining) [2021-12-22 16:40:54,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (19 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (18 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (17 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (16 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (15 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (14 of 55 remaining) [2021-12-22 16:40:54,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2021-12-22 16:40:54,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2021-12-22 16:40:54,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2021-12-22 16:40:54,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (10 of 55 remaining) [2021-12-22 16:40:54,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (9 of 55 remaining) [2021-12-22 16:40:54,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2021-12-22 16:40:54,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2021-12-22 16:40:54,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2021-12-22 16:40:54,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (5 of 55 remaining) [2021-12-22 16:40:54,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (4 of 55 remaining) [2021-12-22 16:40:54,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2021-12-22 16:40:54,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2021-12-22 16:40:54,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2021-12-22 16:40:54,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2021-12-22 16:40:54,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:54,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:40:54,928 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:54,932 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 16:40:54,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:40:54 BoogieIcfgContainer [2021-12-22 16:40:54,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 16:40:54,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 16:40:54,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 16:40:54,949 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 16:40:54,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:48" (3/4) ... [2021-12-22 16:40:54,952 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 16:40:54,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 16:40:54,952 INFO L158 Benchmark]: Toolchain (without parser) took 7082.30ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 36.1MB in the beginning and 30.9MB in the end (delta: 5.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2021-12-22 16:40:54,952 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:40:54,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.50ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 34.2MB in the end (delta: 1.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2021-12-22 16:40:54,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.59ms. Allocated memory is still 58.7MB. Free memory was 34.2MB in the beginning and 32.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:40:54,953 INFO L158 Benchmark]: Boogie Preprocessor took 19.45ms. Allocated memory is still 58.7MB. Free memory was 32.1MB in the beginning and 30.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:40:54,953 INFO L158 Benchmark]: RCFGBuilder took 667.70ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 30.3MB in the beginning and 41.7MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 16:40:54,954 INFO L158 Benchmark]: TraceAbstraction took 5957.83ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 41.5MB in the beginning and 30.9MB in the end (delta: 10.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2021-12-22 16:40:54,954 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 92.3MB. Free memory is still 30.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:40:54,955 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.50ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 34.2MB in the end (delta: 1.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.59ms. Allocated memory is still 58.7MB. Free memory was 34.2MB in the beginning and 32.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.45ms. Allocated memory is still 58.7MB. Free memory was 32.1MB in the beginning and 30.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 667.70ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 30.3MB in the beginning and 41.7MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5957.83ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 41.5MB in the beginning and 30.9MB in the end (delta: 10.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 92.3MB. Free memory is still 30.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK VAL [list={6:0}] [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={6:0}, list={6:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1039] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1043] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={6:0}, end->next={0:0}, list={6:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={6:0}, list={6:0}] - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 837 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 1343 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 592 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 191 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 378 SizeOfPredicates, 26 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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 [2021-12-22 16:40:54,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample