./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b 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/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:45:24,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:45:24,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:45:24,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:45:24,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:45:24,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:45:24,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:45:24,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:45:24,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:45:24,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:45:24,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:45:24,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:45:24,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:45:24,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:45:24,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:45:24,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:45:24,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:45:24,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:45:24,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:45:24,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:45:24,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:45:24,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:45:24,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:45:24,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:45:24,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:45:24,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:45:24,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:45:24,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:45:24,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:45:24,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:45:24,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:45:24,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:45:24,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:45:24,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:45:24,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:45:24,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:45:24,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:45:24,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:45:24,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:45:24,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:45:24,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:45:24,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:45:24,983 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:45:24,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:45:24,983 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:45:24,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:45:24,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:45:24,984 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:45:24,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:45:24,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:45:24,985 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:45:24,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:45:24,986 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:45:24,986 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:45:24,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:45:24,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:45:24,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:45:24,987 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:45:24,987 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:45:24,987 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:45:24,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:45:24,987 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:45:24,987 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:45:24,987 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:45:24,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:45:24,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:45:24,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:45:24,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:24,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:45:24,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:45:24,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:45:24,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:45:24,990 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:45:24,990 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2021-12-14 19:45:25,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:45:25,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:45:25,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:45:25,228 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:45:25,239 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:45:25,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-12-14 19:45:25,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265f282c4/00ae958da2ce4785a7e98ddfebc7e865/FLAGfdfc419a9 [2021-12-14 19:45:25,727 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:45:25,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-12-14 19:45:25,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265f282c4/00ae958da2ce4785a7e98ddfebc7e865/FLAGfdfc419a9 [2021-12-14 19:45:25,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265f282c4/00ae958da2ce4785a7e98ddfebc7e865 [2021-12-14 19:45:25,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:45:25,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:45:25,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:25,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:45:25,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:45:25,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:25" (1/1) ... [2021-12-14 19:45:25,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d6d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:25, skipping insertion in model container [2021-12-14 19:45:25,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:25" (1/1) ... [2021-12-14 19:45:25,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:45:25,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:45:26,012 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/dll-rb-cnstr_1-2.i[22575,22588] [2021-12-14 19:45:26,018 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/dll-rb-cnstr_1-2.i[22647,22660] [2021-12-14 19:45:26,020 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/dll-rb-cnstr_1-2.i[22815,22828] [2021-12-14 19:45:26,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:26,031 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:45:26,064 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/dll-rb-cnstr_1-2.i[22575,22588] [2021-12-14 19:45:26,064 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/dll-rb-cnstr_1-2.i[22647,22660] [2021-12-14 19:45:26,065 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/dll-rb-cnstr_1-2.i[22815,22828] [2021-12-14 19:45:26,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:26,082 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:45:26,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26 WrapperNode [2021-12-14 19:45:26,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:26,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:26,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:45:26,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:45:26,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,137 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2021-12-14 19:45:26,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:26,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:45:26,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:45:26,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:45:26,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:45:26,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:45:26,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:45:26,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:45:26,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:26,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:26,196 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-14 19:45:26,203 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-14 19:45:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:45:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:45:26,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:45:26,283 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:45:26,284 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:45:26,645 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:45:26,650 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:45:26,652 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-14 19:45:26,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:26 BoogieIcfgContainer [2021-12-14 19:45:26,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:45:26,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:45:26,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:45:26,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:45:26,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:45:25" (1/3) ... [2021-12-14 19:45:26,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78656efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:26, skipping insertion in model container [2021-12-14 19:45:26,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26" (2/3) ... [2021-12-14 19:45:26,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78656efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:26, skipping insertion in model container [2021-12-14 19:45:26,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:26" (3/3) ... [2021-12-14 19:45:26,661 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-12-14 19:45:26,665 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:45:26,665 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-14 19:45:26,699 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:45:26,705 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-14 19:45:26,706 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-14 19:45:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 72 states have (on average 2.1527777777777777) internal successors, (155), 137 states have internal predecessors, (155), 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-14 19:45:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:26,731 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:26,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:26,733 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:26,736 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:45:26,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077014354] [2021-12-14 19:45:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:26,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:26,866 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-14 19:45:26,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077014354] [2021-12-14 19:45:26,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077014354] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:26,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:26,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:26,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936929985] [2021-12-14 19:45:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:26,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:26,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:26,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:26,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:26,895 INFO L87 Difference]: Start difference. First operand has 138 states, 72 states have (on average 2.1527777777777777) internal successors, (155), 137 states have internal predecessors, (155), 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-14 19:45:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:27,047 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2021-12-14 19:45:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:27,049 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-14 19:45:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:27,056 INFO L225 Difference]: With dead ends: 139 [2021-12-14 19:45:27,056 INFO L226 Difference]: Without dead ends: 135 [2021-12-14 19:45:27,058 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-14 19:45:27,060 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:27,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 79 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-14 19:45:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2021-12-14 19:45:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 130 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-14 19:45:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2021-12-14 19:45:27,106 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 3 [2021-12-14 19:45:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:27,106 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2021-12-14 19:45:27,106 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-14 19:45:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2021-12-14 19:45:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:27,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:27,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:27,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:45:27,108 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:45:27,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:27,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707349102] [2021-12-14 19:45:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:27,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:27,167 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-14 19:45:27,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707349102] [2021-12-14 19:45:27,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707349102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:27,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:27,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:27,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760548038] [2021-12-14 19:45:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:27,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:27,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:27,174 INFO L87 Difference]: Start difference. First operand 131 states and 138 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-14 19:45:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:27,274 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2021-12-14 19:45:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:27,275 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-14 19:45:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:27,276 INFO L225 Difference]: With dead ends: 148 [2021-12-14 19:45:27,277 INFO L226 Difference]: Without dead ends: 148 [2021-12-14 19:45:27,277 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-14 19:45:27,278 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:27,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-14 19:45:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2021-12-14 19:45:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.775) internal successors, (142), 134 states have internal predecessors, (142), 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-14 19:45:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2021-12-14 19:45:27,283 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 3 [2021-12-14 19:45:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:27,283 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2021-12-14 19:45:27,283 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-14 19:45:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2021-12-14 19:45:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:45:27,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:27,284 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:27,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:45:27,284 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:27,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2021-12-14 19:45:27,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:27,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710279439] [2021-12-14 19:45:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:27,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:27,381 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-14 19:45:27,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:27,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710279439] [2021-12-14 19:45:27,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710279439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:27,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:27,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:27,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855092726] [2021-12-14 19:45:27,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:27,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:27,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:27,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:27,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:27,383 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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-14 19:45:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:27,511 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2021-12-14 19:45:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:27,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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-14 19:45:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:27,512 INFO L225 Difference]: With dead ends: 140 [2021-12-14 19:45:27,512 INFO L226 Difference]: Without dead ends: 140 [2021-12-14 19:45:27,513 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-14 19:45:27,513 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 185 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:27,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 65 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-14 19:45:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2021-12-14 19:45:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6265060240963856) internal successors, (135), 124 states have internal predecessors, (135), 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-14 19:45:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2021-12-14 19:45:27,518 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 9 [2021-12-14 19:45:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:27,518 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2021-12-14 19:45:27,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-14 19:45:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2021-12-14 19:45:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:45:27,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:27,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:27,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:45:27,519 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2021-12-14 19:45:27,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493334681] [2021-12-14 19:45:27,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:27,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:27,601 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-14 19:45:27,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:27,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493334681] [2021-12-14 19:45:27,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493334681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:27,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:27,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:27,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732864552] [2021-12-14 19:45:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:27,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:45:27,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:45:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:27,603 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-14 19:45:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:27,802 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2021-12-14 19:45:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:27,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-14 19:45:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:27,803 INFO L225 Difference]: With dead ends: 169 [2021-12-14 19:45:27,803 INFO L226 Difference]: Without dead ends: 169 [2021-12-14 19:45:27,803 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-14 19:45:27,804 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 175 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:27,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 121 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-14 19:45:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 138. [2021-12-14 19:45:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 137 states have internal predecessors, (152), 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-14 19:45:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2021-12-14 19:45:27,809 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 9 [2021-12-14 19:45:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:27,810 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2021-12-14 19:45:27,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-14 19:45:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2021-12-14 19:45:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:45:27,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:27,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:27,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:45:27,811 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 233109700, now seen corresponding path program 1 times [2021-12-14 19:45:27,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523756162] [2021-12-14 19:45:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:27,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:27,840 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-14 19:45:27,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:27,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523756162] [2021-12-14 19:45:27,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523756162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:27,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:27,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:27,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038668261] [2021-12-14 19:45:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:27,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:27,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:27,842 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 19:45:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:27,929 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2021-12-14 19:45:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 19:45:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:27,931 INFO L225 Difference]: With dead ends: 154 [2021-12-14 19:45:27,931 INFO L226 Difference]: Without dead ends: 154 [2021-12-14 19:45:27,931 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-14 19:45:27,932 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 143 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:27,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 146 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-14 19:45:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2021-12-14 19:45:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 135 states have internal predecessors, (148), 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-14 19:45:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2021-12-14 19:45:27,936 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 11 [2021-12-14 19:45:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:27,936 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2021-12-14 19:45:27,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 19:45:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2021-12-14 19:45:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:45:27,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:27,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:27,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:45:27,937 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-14 19:45:27,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:27,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033838595] [2021-12-14 19:45:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:27,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:27,987 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-14 19:45:27,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:27,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033838595] [2021-12-14 19:45:27,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033838595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:27,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:27,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:27,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260229417] [2021-12-14 19:45:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:27,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:27,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:27,989 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-14 19:45:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,102 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2021-12-14 19:45:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-14 19:45:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,103 INFO L225 Difference]: With dead ends: 135 [2021-12-14 19:45:28,103 INFO L226 Difference]: Without dead ends: 135 [2021-12-14 19:45:28,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:28,104 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:28,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 267 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-14 19:45:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-12-14 19:45:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 134 states have internal predecessors, (146), 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-14 19:45:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2021-12-14 19:45:28,108 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 12 [2021-12-14 19:45:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:28,108 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2021-12-14 19:45:28,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-14 19:45:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2021-12-14 19:45:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:45:28,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:28,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:45:28,109 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-14 19:45:28,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311751126] [2021-12-14 19:45:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,141 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-14 19:45:28,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311751126] [2021-12-14 19:45:28,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311751126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:28,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539188613] [2021-12-14 19:45:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:28,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:28,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:28,143 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-14 19:45:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,240 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2021-12-14 19:45:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:28,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-14 19:45:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,241 INFO L225 Difference]: With dead ends: 134 [2021-12-14 19:45:28,242 INFO L226 Difference]: Without dead ends: 134 [2021-12-14 19:45:28,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:28,242 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:28,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-14 19:45:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-12-14 19:45:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 96 states have (on average 1.5) internal successors, (144), 133 states have internal predecessors, (144), 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-14 19:45:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2021-12-14 19:45:28,246 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 12 [2021-12-14 19:45:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:28,246 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2021-12-14 19:45:28,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-14 19:45:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2021-12-14 19:45:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:45:28,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:28,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:45:28,248 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,248 INFO L85 PathProgramCache]: Analyzing trace with hash -387042850, now seen corresponding path program 1 times [2021-12-14 19:45:28,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643176931] [2021-12-14 19:45:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,308 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-14 19:45:28,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643176931] [2021-12-14 19:45:28,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643176931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:45:28,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940874600] [2021-12-14 19:45:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:45:28,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:45:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:28,310 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-14 19:45:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,458 INFO L93 Difference]: Finished difference Result 194 states and 209 transitions. [2021-12-14 19:45:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2021-12-14 19:45:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,460 INFO L225 Difference]: With dead ends: 194 [2021-12-14 19:45:28,460 INFO L226 Difference]: Without dead ends: 194 [2021-12-14 19:45:28,460 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-14 19:45:28,460 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 175 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:28,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 283 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-14 19:45:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 139. [2021-12-14 19:45:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 138 states have internal predecessors, (149), 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-14 19:45:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2021-12-14 19:45:28,464 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 14 [2021-12-14 19:45:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:28,464 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2021-12-14 19:45:28,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-14 19:45:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2021-12-14 19:45:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:45:28,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:28,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:45:28,465 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-14 19:45:28,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655768738] [2021-12-14 19:45:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,558 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-14 19:45:28,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655768738] [2021-12-14 19:45:28,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655768738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:28,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954354628] [2021-12-14 19:45:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:28,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:28,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:28,561 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-14 19:45:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,815 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2021-12-14 19:45:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2021-12-14 19:45:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,816 INFO L225 Difference]: With dead ends: 139 [2021-12-14 19:45:28,816 INFO L226 Difference]: Without dead ends: 139 [2021-12-14 19:45:28,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:45:28,817 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 154 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:28,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 200 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-14 19:45:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2021-12-14 19:45:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 137 states have internal predecessors, (148), 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-14 19:45:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2021-12-14 19:45:28,820 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 16 [2021-12-14 19:45:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:28,820 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2021-12-14 19:45:28,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-14 19:45:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2021-12-14 19:45:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:45:28,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:28,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:45:28,821 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-14 19:45:28,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616812155] [2021-12-14 19:45:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,926 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-14 19:45:28,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616812155] [2021-12-14 19:45:28,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616812155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:45:28,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696611913] [2021-12-14 19:45:28,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:45:28,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:45:28,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:45:28,928 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-14 19:45:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:29,295 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2021-12-14 19:45:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:45:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 16 [2021-12-14 19:45:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:29,296 INFO L225 Difference]: With dead ends: 143 [2021-12-14 19:45:29,296 INFO L226 Difference]: Without dead ends: 143 [2021-12-14 19:45:29,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-14 19:45:29,297 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 166 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:29,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 206 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-14 19:45:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2021-12-14 19:45:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 133 states have internal predecessors, (145), 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-14 19:45:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2021-12-14 19:45:29,299 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 16 [2021-12-14 19:45:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:29,299 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2021-12-14 19:45:29,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-14 19:45:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2021-12-14 19:45:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:45:29,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:29,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:29,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:45:29,300 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -575141435, now seen corresponding path program 1 times [2021-12-14 19:45:29,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:29,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484679488] [2021-12-14 19:45:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:29,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:29,349 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-14 19:45:29,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:29,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484679488] [2021-12-14 19:45:29,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484679488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:29,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:29,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:29,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063058960] [2021-12-14 19:45:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:29,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:29,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:29,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:29,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:29,351 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-14 19:45:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:29,435 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-12-14 19:45:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2021-12-14 19:45:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:29,436 INFO L225 Difference]: With dead ends: 140 [2021-12-14 19:45:29,436 INFO L226 Difference]: Without dead ends: 140 [2021-12-14 19:45:29,436 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-14 19:45:29,437 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 14 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:29,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 292 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-14 19:45:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2021-12-14 19:45:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 132 states have internal predecessors, (143), 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-14 19:45:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2021-12-14 19:45:29,440 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 20 [2021-12-14 19:45:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:29,440 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2021-12-14 19:45:29,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-14 19:45:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2021-12-14 19:45:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:45:29,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:29,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:29,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:45:29,441 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash -574830553, now seen corresponding path program 1 times [2021-12-14 19:45:29,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:29,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954594416] [2021-12-14 19:45:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:29,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:45:29,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:45:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:45:29,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 19:45:29,469 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:45:29,470 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (64 of 65 remaining) [2021-12-14 19:45:29,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (63 of 65 remaining) [2021-12-14 19:45:29,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (62 of 65 remaining) [2021-12-14 19:45:29,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (61 of 65 remaining) [2021-12-14 19:45:29,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (60 of 65 remaining) [2021-12-14 19:45:29,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (59 of 65 remaining) [2021-12-14 19:45:29,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (58 of 65 remaining) [2021-12-14 19:45:29,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (57 of 65 remaining) [2021-12-14 19:45:29,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (56 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (55 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (54 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (53 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (52 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (51 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (50 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (49 of 65 remaining) [2021-12-14 19:45:29,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (48 of 65 remaining) [2021-12-14 19:45:29,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (47 of 65 remaining) [2021-12-14 19:45:29,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (46 of 65 remaining) [2021-12-14 19:45:29,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (45 of 65 remaining) [2021-12-14 19:45:29,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (44 of 65 remaining) [2021-12-14 19:45:29,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (43 of 65 remaining) [2021-12-14 19:45:29,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (42 of 65 remaining) [2021-12-14 19:45:29,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (41 of 65 remaining) [2021-12-14 19:45:29,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (40 of 65 remaining) [2021-12-14 19:45:29,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (39 of 65 remaining) [2021-12-14 19:45:29,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (38 of 65 remaining) [2021-12-14 19:45:29,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (37 of 65 remaining) [2021-12-14 19:45:29,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (36 of 65 remaining) [2021-12-14 19:45:29,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (35 of 65 remaining) [2021-12-14 19:45:29,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (34 of 65 remaining) [2021-12-14 19:45:29,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (33 of 65 remaining) [2021-12-14 19:45:29,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (32 of 65 remaining) [2021-12-14 19:45:29,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (31 of 65 remaining) [2021-12-14 19:45:29,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (30 of 65 remaining) [2021-12-14 19:45:29,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (29 of 65 remaining) [2021-12-14 19:45:29,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (28 of 65 remaining) [2021-12-14 19:45:29,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (27 of 65 remaining) [2021-12-14 19:45:29,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (26 of 65 remaining) [2021-12-14 19:45:29,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (25 of 65 remaining) [2021-12-14 19:45:29,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (24 of 65 remaining) [2021-12-14 19:45:29,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (23 of 65 remaining) [2021-12-14 19:45:29,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (22 of 65 remaining) [2021-12-14 19:45:29,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (21 of 65 remaining) [2021-12-14 19:45:29,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (20 of 65 remaining) [2021-12-14 19:45:29,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (19 of 65 remaining) [2021-12-14 19:45:29,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (18 of 65 remaining) [2021-12-14 19:45:29,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (17 of 65 remaining) [2021-12-14 19:45:29,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (16 of 65 remaining) [2021-12-14 19:45:29,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (15 of 65 remaining) [2021-12-14 19:45:29,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (14 of 65 remaining) [2021-12-14 19:45:29,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (13 of 65 remaining) [2021-12-14 19:45:29,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (12 of 65 remaining) [2021-12-14 19:45:29,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (11 of 65 remaining) [2021-12-14 19:45:29,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (10 of 65 remaining) [2021-12-14 19:45:29,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (9 of 65 remaining) [2021-12-14 19:45:29,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (8 of 65 remaining) [2021-12-14 19:45:29,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (7 of 65 remaining) [2021-12-14 19:45:29,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (6 of 65 remaining) [2021-12-14 19:45:29,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (5 of 65 remaining) [2021-12-14 19:45:29,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (4 of 65 remaining) [2021-12-14 19:45:29,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (3 of 65 remaining) [2021-12-14 19:45:29,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (2 of 65 remaining) [2021-12-14 19:45:29,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (1 of 65 remaining) [2021-12-14 19:45:29,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (0 of 65 remaining) [2021-12-14 19:45:29,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:45:29,483 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:29,485 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:45:29,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:45:29 BoogieIcfgContainer [2021-12-14 19:45:29,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:45:29,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:45:29,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:45:29,501 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:45:29,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:26" (3/4) ... [2021-12-14 19:45:29,503 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:45:29,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:45:29,504 INFO L158 Benchmark]: Toolchain (without parser) took 3752.30ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 79.3MB in the beginning and 81.9MB in the end (delta: -2.6MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2021-12-14 19:45:29,504 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:45:29,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.61ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:45:29,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.13ms. Allocated memory is still 109.1MB. Free memory was 76.1MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:45:29,505 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:45:29,505 INFO L158 Benchmark]: RCFGBuilder took 487.39ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 72.3MB in the beginning and 113.9MB in the end (delta: -41.6MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2021-12-14 19:45:29,505 INFO L158 Benchmark]: TraceAbstraction took 2844.65ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 113.8MB in the beginning and 82.9MB in the end (delta: 30.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2021-12-14 19:45:29,506 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 169.9MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:45:29,507 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.11ms. Allocated memory is still 109.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.61ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.13ms. Allocated memory is still 109.1MB. Free memory was 76.1MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.39ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 72.3MB in the beginning and 113.9MB in the end (delta: -41.6MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2844.65ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 113.8MB in the beginning and 82.9MB in the end (delta: 30.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 169.9MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={-1:0}] [L1007] list->prev = ((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()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1045] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: 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: 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: 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: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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: 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: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: 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: 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: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: 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, 138 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1257 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1257 mSDsluCounter, 2021 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1188 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2201 IncrementalHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 833 mSDtfsCounter, 2201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=8, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 153 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 693 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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-14 19:45:29,539 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 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/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:45:31,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:45:31,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:45:31,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:45:31,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:45:31,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:45:31,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:45:31,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:45:31,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:45:31,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:45:31,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:45:31,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:45:31,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:45:31,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:45:31,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:45:31,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:45:31,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:45:31,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:45:31,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:45:31,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:45:31,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:45:31,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:45:31,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:45:31,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:45:31,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:45:31,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:45:31,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:45:31,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:45:31,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:45:31,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:45:31,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:45:31,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:45:31,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:45:31,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:45:31,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:45:31,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:45:31,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:45:31,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:45:31,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:45:31,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:45:31,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:45:31,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:45:31,374 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:45:31,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:45:31,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:45:31,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:45:31,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:45:31,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:45:31,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:45:31,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:45:31,378 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:45:31,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:45:31,378 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:45:31,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:45:31,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:45:31,380 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:45:31,380 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:45:31,380 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:45:31,380 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:45:31,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:45:31,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:45:31,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:45:31,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:31,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:45:31,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:45:31,381 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:45:31,381 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:45:31,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:45:31,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:45:31,382 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2021-12-14 19:45:31,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:45:31,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:45:31,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:45:31,638 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:45:31,638 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:45:31,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-12-14 19:45:31,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab11bb511/969f3f3ed90c4ee68d68f1b5f3c2ac5a/FLAG06ce34528 [2021-12-14 19:45:32,133 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:45:32,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-12-14 19:45:32,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab11bb511/969f3f3ed90c4ee68d68f1b5f3c2ac5a/FLAG06ce34528 [2021-12-14 19:45:32,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab11bb511/969f3f3ed90c4ee68d68f1b5f3c2ac5a [2021-12-14 19:45:32,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:45:32,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:45:32,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:32,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:45:32,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:45:32,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722d2210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32, skipping insertion in model container [2021-12-14 19:45:32,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:45:32,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:45:32,439 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/dll-rb-cnstr_1-2.i[22575,22588] [2021-12-14 19:45:32,442 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/dll-rb-cnstr_1-2.i[22647,22660] [2021-12-14 19:45:32,445 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/dll-rb-cnstr_1-2.i[22815,22828] [2021-12-14 19:45:32,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:32,462 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:45:32,489 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/dll-rb-cnstr_1-2.i[22575,22588] [2021-12-14 19:45:32,491 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/dll-rb-cnstr_1-2.i[22647,22660] [2021-12-14 19:45:32,494 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/dll-rb-cnstr_1-2.i[22815,22828] [2021-12-14 19:45:32,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:32,521 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:45:32,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32 WrapperNode [2021-12-14 19:45:32,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:32,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:32,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:45:32,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:45:32,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,576 INFO L137 Inliner]: procedures = 122, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2021-12-14 19:45:32,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:32,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:45:32,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:45:32,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:45:32,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:45:32,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:45:32,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:45:32,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:45:32,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (1/1) ... [2021-12-14 19:45:32,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:32,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:32,653 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-14 19:45:32,677 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-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:45:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:45:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:45:32,777 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:45:32,778 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:45:33,192 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:45:33,196 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:45:33,197 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-14 19:45:33,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:33 BoogieIcfgContainer [2021-12-14 19:45:33,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:45:33,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:45:33,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:45:33,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:45:33,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:45:32" (1/3) ... [2021-12-14 19:45:33,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8025055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:33, skipping insertion in model container [2021-12-14 19:45:33,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:32" (2/3) ... [2021-12-14 19:45:33,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8025055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:33, skipping insertion in model container [2021-12-14 19:45:33,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:33" (3/3) ... [2021-12-14 19:45:33,205 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-12-14 19:45:33,209 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:45:33,210 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-14 19:45:33,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:45:33,249 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-14 19:45:33,249 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-14 19:45:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 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-14 19:45:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:33,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:33,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:33,270 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:33,274 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:45:33,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:33,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834880266] [2021-12-14 19:45:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:33,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:33,284 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-14 19:45:33,285 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-14 19:45:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:33,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:45:33,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:33,392 INFO L388 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-14 19:45:33,400 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-14 19:45:33,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:33,401 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:33,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834880266] [2021-12-14 19:45:33,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834880266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:33,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:33,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:33,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759554894] [2021-12-14 19:45:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:33,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:33,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:33,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:33,433 INFO L87 Difference]: Start difference. First operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 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-14 19:45:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:33,618 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-12-14 19:45:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:33,620 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-14 19:45:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:33,625 INFO L225 Difference]: With dead ends: 137 [2021-12-14 19:45:33,626 INFO L226 Difference]: Without dead ends: 133 [2021-12-14 19:45:33,627 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-14 19:45:33,629 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:33,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-14 19:45:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2021-12-14 19:45:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 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-14 19:45:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2021-12-14 19:45:33,659 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 3 [2021-12-14 19:45:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:33,659 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2021-12-14 19:45:33,659 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-14 19:45:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2021-12-14 19:45:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:33,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:33,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:33,669 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-14 19:45:33,866 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-14 19:45:33,867 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:45:33,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:33,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528204978] [2021-12-14 19:45:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:33,868 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:33,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:33,874 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-14 19:45:33,875 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-14 19:45:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:33,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:45:33,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:33,940 INFO L388 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-14 19:45:33,948 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-14 19:45:33,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:33,949 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:33,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528204978] [2021-12-14 19:45:33,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528204978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:33,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:33,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:33,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717356410] [2021-12-14 19:45:33,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:33,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:33,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:33,951 INFO L87 Difference]: Start difference. First operand 129 states and 136 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-14 19:45:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,120 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2021-12-14 19:45:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:34,120 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-14 19:45:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,121 INFO L225 Difference]: With dead ends: 146 [2021-12-14 19:45:34,121 INFO L226 Difference]: Without dead ends: 146 [2021-12-14 19:45:34,122 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-14 19:45:34,122 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 111 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:34,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-14 19:45:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2021-12-14 19:45:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.794871794871795) internal successors, (140), 132 states have internal predecessors, (140), 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-14 19:45:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2021-12-14 19:45:34,129 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 3 [2021-12-14 19:45:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,129 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2021-12-14 19:45:34,129 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-14 19:45:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2021-12-14 19:45:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:45:34,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:34,155 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-14 19:45:34,336 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-14 19:45:34,336 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2021-12-14 19:45:34,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553559337] [2021-12-14 19:45:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,344 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:34,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:34,345 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-14 19:45:34,346 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-14 19:45:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:45:34,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:34,406 INFO L388 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-14 19:45:34,447 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:45:34,448 INFO L388 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 21 treesize of output 26 [2021-12-14 19:45:34,462 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-14 19:45:34,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:34,462 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553559337] [2021-12-14 19:45:34,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553559337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:34,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317062166] [2021-12-14 19:45:34,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:34,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:34,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:34,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:34,464 INFO L87 Difference]: Start difference. First operand 133 states and 140 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-14 19:45:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,700 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2021-12-14 19:45:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:34,701 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-14 19:45:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,702 INFO L225 Difference]: With dead ends: 138 [2021-12-14 19:45:34,702 INFO L226 Difference]: Without dead ends: 138 [2021-12-14 19:45:34,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:34,703 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 182 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:34,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 63 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-14 19:45:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2021-12-14 19:45:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 122 states have internal predecessors, (133), 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-14 19:45:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-12-14 19:45:34,709 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 8 [2021-12-14 19:45:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,709 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-12-14 19:45:34,709 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-14 19:45:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-12-14 19:45:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:45:34,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:34,729 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-14 19:45:34,917 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-14 19:45:34,917 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2021-12-14 19:45:34,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:34,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889749322] [2021-12-14 19:45:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:34,919 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-14 19:45:34,926 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-14 19:45:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:45:34,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:35,001 INFO L388 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-14 19:45:35,070 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:35,071 INFO L388 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-14 19:45:35,080 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-14 19:45:35,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:35,081 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:35,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889749322] [2021-12-14 19:45:35,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889749322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:35,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:35,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:35,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011917201] [2021-12-14 19:45:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:35,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:35,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:35,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:35,083 INFO L87 Difference]: Start difference. First operand 123 states and 133 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-14 19:45:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:35,422 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2021-12-14 19:45:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:35,423 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-14 19:45:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:35,423 INFO L225 Difference]: With dead ends: 166 [2021-12-14 19:45:35,424 INFO L226 Difference]: Without dead ends: 166 [2021-12-14 19:45:35,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-14 19:45:35,425 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:35,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 93 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:45:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-14 19:45:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 135. [2021-12-14 19:45:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 134 states have internal predecessors, (149), 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-14 19:45:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2021-12-14 19:45:35,431 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 8 [2021-12-14 19:45:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:35,431 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2021-12-14 19:45:35,431 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-14 19:45:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2021-12-14 19:45:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:45:35,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:35,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:35,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:35,639 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-14 19:45:35,639 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1116012804, now seen corresponding path program 1 times [2021-12-14 19:45:35,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:35,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671248698] [2021-12-14 19:45:35,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:35,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:35,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:35,641 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-14 19:45:35,643 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-14 19:45:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:35,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:45:35,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:35,728 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-14 19:45:35,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:35,728 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:35,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671248698] [2021-12-14 19:45:35,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671248698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:35,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:35,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:35,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084286427] [2021-12-14 19:45:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:35,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:35,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:35,731 INFO L87 Difference]: Start difference. First operand 135 states and 149 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-14 19:45:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:35,922 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2021-12-14 19:45:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:35,923 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-14 19:45:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:35,924 INFO L225 Difference]: With dead ends: 151 [2021-12-14 19:45:35,924 INFO L226 Difference]: Without dead ends: 151 [2021-12-14 19:45:35,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-14 19:45:35,925 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 141 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:35,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 142 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-14 19:45:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2021-12-14 19:45:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.5591397849462365) internal successors, (145), 132 states have internal predecessors, (145), 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-14 19:45:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-14 19:45:35,930 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 10 [2021-12-14 19:45:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:35,930 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-14 19:45:35,930 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-14 19:45:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-14 19:45:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:45:35,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:35,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:35,949 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-14 19:45:36,131 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-14 19:45:36,131 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-12-14 19:45:36,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:36,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351138196] [2021-12-14 19:45:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:36,133 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:36,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:36,134 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-14 19:45:36,136 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-14 19:45:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:45:36,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:36,220 INFO L388 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-14 19:45:36,230 INFO L388 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-14 19:45:36,242 INFO L388 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 21 treesize of output 13 [2021-12-14 19:45:36,248 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-14 19:45:36,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:36,248 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:36,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351138196] [2021-12-14 19:45:36,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351138196] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:36,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:36,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:36,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286892858] [2021-12-14 19:45:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:36,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:36,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:36,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:36,249 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-14 19:45:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:36,601 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2021-12-14 19:45:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:36,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-14 19:45:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:36,603 INFO L225 Difference]: With dead ends: 132 [2021-12-14 19:45:36,603 INFO L226 Difference]: Without dead ends: 132 [2021-12-14 19:45:36,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:36,604 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:36,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 270 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:45:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-14 19:45:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-12-14 19:45:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 131 states have internal predecessors, (143), 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-14 19:45:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2021-12-14 19:45:36,608 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 11 [2021-12-14 19:45:36,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:36,608 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2021-12-14 19:45:36,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-14 19:45:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2021-12-14 19:45:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:45:36,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:36,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:36,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-14 19:45:36,816 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-14 19:45:36,816 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-12-14 19:45:36,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:36,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028029437] [2021-12-14 19:45:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:36,818 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:36,819 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-14 19:45:36,820 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-14 19:45:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:45:36,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:36,891 INFO L388 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-14 19:45:36,911 INFO L388 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-14 19:45:36,915 INFO L388 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-14 19:45:36,951 INFO L388 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-14 19:45:36,953 INFO L388 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-14 19:45:36,978 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-14 19:45:36,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:36,978 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:36,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028029437] [2021-12-14 19:45:36,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028029437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:36,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:36,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:36,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224518363] [2021-12-14 19:45:36,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:36,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:36,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:36,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:36,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:36,987 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-14 19:45:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:37,342 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2021-12-14 19:45:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-14 19:45:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:37,343 INFO L225 Difference]: With dead ends: 131 [2021-12-14 19:45:37,343 INFO L226 Difference]: Without dead ends: 131 [2021-12-14 19:45:37,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:37,344 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:37,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 259 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:45:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-14 19:45:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-14 19:45:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 130 states have internal predecessors, (141), 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-14 19:45:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2021-12-14 19:45:37,348 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 11 [2021-12-14 19:45:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:37,348 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2021-12-14 19:45:37,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-14 19:45:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2021-12-14 19:45:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:45:37,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:37,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:37,375 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-14 19:45:37,556 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-14 19:45:37,556 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -200394276, now seen corresponding path program 1 times [2021-12-14 19:45:37,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:37,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136704275] [2021-12-14 19:45:37,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,558 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:37,559 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-14 19:45:37,561 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-14 19:45:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:37,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:45:37,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:37,624 INFO L388 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-14 19:45:37,663 INFO L388 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-14 19:45:37,670 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-14 19:45:37,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:37,671 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:37,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136704275] [2021-12-14 19:45:37,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136704275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:37,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:37,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:37,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069631646] [2021-12-14 19:45:37,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:37,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:37,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:37,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:37,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:37,672 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-14 19:45:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:37,963 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2021-12-14 19:45:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-14 19:45:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:37,964 INFO L225 Difference]: With dead ends: 191 [2021-12-14 19:45:37,964 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 19:45:37,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-14 19:45:37,965 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 81 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:37,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 267 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:45:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 19:45:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 136. [2021-12-14 19:45:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.489795918367347) internal successors, (146), 135 states have internal predecessors, (146), 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-14 19:45:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2021-12-14 19:45:37,968 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 13 [2021-12-14 19:45:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:37,968 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2021-12-14 19:45:37,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-14 19:45:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2021-12-14 19:45:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:45:37,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:37,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:37,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-14 19:45:38,183 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-14 19:45:38,184 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-12-14 19:45:38,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382131609] [2021-12-14 19:45:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:38,185 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:38,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:38,186 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-14 19:45:38,188 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-14 19:45:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:38,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:45:38,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:38,304 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:45:38,304 INFO L388 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 14 treesize of output 23 [2021-12-14 19:45:38,503 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-14 19:45:38,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 58 [2021-12-14 19:45:38,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:45:39,193 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:39,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2021-12-14 19:45:39,481 INFO L388 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 47 treesize of output 31 [2021-12-14 19:45:39,907 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-14 19:45:39,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:39,907 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:39,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382131609] [2021-12-14 19:45:39,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382131609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:39,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:39,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:39,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175450725] [2021-12-14 19:45:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:39,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:45:39,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:39,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:45:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:45:39,908 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-14 19:45:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:40,066 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2021-12-14 19:45:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:40,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2021-12-14 19:45:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:40,068 INFO L225 Difference]: With dead ends: 212 [2021-12-14 19:45:40,068 INFO L226 Difference]: Without dead ends: 212 [2021-12-14 19:45:40,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:45:40,068 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 70 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:40,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 411 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 460 Unchecked, 0.1s Time] [2021-12-14 19:45:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-14 19:45:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 138. [2021-12-14 19:45:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.49) internal successors, (149), 137 states have internal predecessors, (149), 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-14 19:45:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2021-12-14 19:45:40,072 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 15 [2021-12-14 19:45:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:40,072 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2021-12-14 19:45:40,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-14 19:45:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2021-12-14 19:45:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:45:40,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:40,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:40,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-14 19:45:40,280 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-14 19:45:40,280 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-12-14 19:45:40,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508368722] [2021-12-14 19:45:40,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:40,281 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:40,281 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-14 19:45:40,282 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-14 19:45:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:40,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-14 19:45:40,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:40,363 INFO L388 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-14 19:45:40,389 INFO L388 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-14 19:45:40,398 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:45:40,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-14 19:45:40,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:45:40,426 INFO L388 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-14 19:45:40,484 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:40,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:45:40,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:45:40,508 INFO L388 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 25 treesize of output 13 [2021-12-14 19:45:40,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:45:40,539 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-14 19:45:40,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:40,539 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:40,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508368722] [2021-12-14 19:45:40,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508368722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:40,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:40,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:40,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486808807] [2021-12-14 19:45:40,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:40,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:40,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:40,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:40,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:40,540 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-14 19:45:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:41,314 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2021-12-14 19:45:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:45:41,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2021-12-14 19:45:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:41,316 INFO L225 Difference]: With dead ends: 142 [2021-12-14 19:45:41,316 INFO L226 Difference]: Without dead ends: 142 [2021-12-14 19:45:41,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:45:41,317 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 157 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:41,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 221 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:45:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-14 19:45:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2021-12-14 19:45:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 138 states have internal predecessors, (150), 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-14 19:45:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2021-12-14 19:45:41,320 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 15 [2021-12-14 19:45:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:41,320 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2021-12-14 19:45:41,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-14 19:45:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2021-12-14 19:45:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:45:41,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:41,321 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-14 19:45:41,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-14 19:45:41,530 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-14 19:45:41,531 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash -715208061, now seen corresponding path program 1 times [2021-12-14 19:45:41,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:41,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782143413] [2021-12-14 19:45:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:41,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:41,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:41,533 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:45:41,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 19:45:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:41,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:45:41,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:41,595 INFO L388 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-14 19:45:41,631 INFO L388 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-14 19:45:41,641 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-14 19:45:41,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:41,641 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:41,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782143413] [2021-12-14 19:45:41,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782143413] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:41,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:41,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:41,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207143551] [2021-12-14 19:45:41,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:41,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:41,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:41,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:41,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:41,642 INFO L87 Difference]: Start difference. First operand 139 states and 150 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-14 19:45:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:41,904 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2021-12-14 19:45:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:41,904 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-14 19:45:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:41,905 INFO L225 Difference]: With dead ends: 192 [2021-12-14 19:45:41,905 INFO L226 Difference]: Without dead ends: 192 [2021-12-14 19:45:41,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-14 19:45:41,906 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:41,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 251 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-14 19:45:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2021-12-14 19:45:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 142 states have internal predecessors, (154), 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-14 19:45:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2021-12-14 19:45:41,908 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 19 [2021-12-14 19:45:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:41,908 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2021-12-14 19:45:41,908 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-14 19:45:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2021-12-14 19:45:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:45:41,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:41,909 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-14 19:45:41,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:42,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:45:42,116 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-14 19:45:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:42,116 INFO L85 PathProgramCache]: Analyzing trace with hash -714897179, now seen corresponding path program 1 times [2021-12-14 19:45:42,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:42,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717140480] [2021-12-14 19:45:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:42,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:42,118 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:45:42,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 19:45:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:45:42,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:45:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:45:42,214 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-14 19:45:42,215 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:45:42,215 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (64 of 65 remaining) [2021-12-14 19:45:42,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (63 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (62 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (61 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (60 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (59 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (58 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (57 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (56 of 65 remaining) [2021-12-14 19:45:42,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (55 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (54 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (53 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (52 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (51 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (50 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (49 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (48 of 65 remaining) [2021-12-14 19:45:42,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (47 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (46 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (45 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (44 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (43 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (42 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (41 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (40 of 65 remaining) [2021-12-14 19:45:42,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (39 of 65 remaining) [2021-12-14 19:45:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (38 of 65 remaining) [2021-12-14 19:45:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (37 of 65 remaining) [2021-12-14 19:45:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (36 of 65 remaining) [2021-12-14 19:45:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (35 of 65 remaining) [2021-12-14 19:45:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (34 of 65 remaining) [2021-12-14 19:45:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (33 of 65 remaining) [2021-12-14 19:45:42,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (32 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (31 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (30 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (29 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (28 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (27 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (26 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (25 of 65 remaining) [2021-12-14 19:45:42,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (24 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (23 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (22 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (21 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (20 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (19 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (18 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (17 of 65 remaining) [2021-12-14 19:45:42,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (16 of 65 remaining) [2021-12-14 19:45:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (15 of 65 remaining) [2021-12-14 19:45:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (14 of 65 remaining) [2021-12-14 19:45:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (13 of 65 remaining) [2021-12-14 19:45:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (12 of 65 remaining) [2021-12-14 19:45:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (11 of 65 remaining) [2021-12-14 19:45:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (10 of 65 remaining) [2021-12-14 19:45:42,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (9 of 65 remaining) [2021-12-14 19:45:42,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (8 of 65 remaining) [2021-12-14 19:45:42,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (7 of 65 remaining) [2021-12-14 19:45:42,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (6 of 65 remaining) [2021-12-14 19:45:42,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (5 of 65 remaining) [2021-12-14 19:45:42,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (4 of 65 remaining) [2021-12-14 19:45:42,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (3 of 65 remaining) [2021-12-14 19:45:42,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (2 of 65 remaining) [2021-12-14 19:45:42,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (1 of 65 remaining) [2021-12-14 19:45:42,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (0 of 65 remaining) [2021-12-14 19:45:42,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:42,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:45:42,428 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:42,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:45:42,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:45:42 BoogieIcfgContainer [2021-12-14 19:45:42,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:45:42,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:45:42,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:45:42,448 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:45:42,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:33" (3/4) ... [2021-12-14 19:45:42,450 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:45:42,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:45:42,451 INFO L158 Benchmark]: Toolchain (without parser) took 10291.83ms. Allocated memory was 69.2MB in the beginning and 134.2MB in the end (delta: 65.0MB). Free memory was 50.2MB in the beginning and 36.4MB in the end (delta: 13.7MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2021-12-14 19:45:42,451 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 56.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:45:42,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.42ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 44.4MB in the end (delta: 5.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 19:45:42,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.19ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:45:42,452 INFO L158 Benchmark]: Boogie Preprocessor took 47.45ms. Allocated memory is still 69.2MB. Free memory was 42.1MB in the beginning and 40.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 19:45:42,452 INFO L158 Benchmark]: RCFGBuilder took 573.36ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 40.7MB in the end (delta: -401.2kB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2021-12-14 19:45:42,452 INFO L158 Benchmark]: TraceAbstraction took 9246.54ms. Allocated memory was 69.2MB in the beginning and 134.2MB in the end (delta: 65.0MB). Free memory was 40.3MB in the beginning and 36.4MB in the end (delta: 3.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2021-12-14 19:45:42,452 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 134.2MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:45:42,454 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.14ms. Allocated memory is still 69.2MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 56.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.42ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 44.4MB in the end (delta: 5.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.19ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.45ms. Allocated memory is still 69.2MB. Free memory was 42.1MB in the beginning and 40.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 573.36ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 40.7MB in the end (delta: -401.2kB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9246.54ms. Allocated memory was 69.2MB in the beginning and 134.2MB in the end (delta: 65.0MB). Free memory was 40.3MB in the beginning and 36.4MB in the end (delta: 3.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 134.2MB. Free memory is still 36.4MB. 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: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={6:0}] [L1007] list->prev = ((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()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={6:0}, list={6:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1041] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1045] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={6:0}, end->next={0:0}, list={6:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={6:0}, list={6:0}] - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: 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: 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: 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: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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: 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: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: 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: 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: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: 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, 136 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1113 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1113 mSDsluCounter, 2136 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 460 IncrementalHoareTripleChecker+Unchecked, 1307 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1779 IncrementalHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 829 mSDtfsCounter, 1779 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 262 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 105 ConstructedInterpolants, 13 QuantifiedInterpolants, 1509 SizeOfPredicates, 41 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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-14 19:45:42,504 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