./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:38:14,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:38:14,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:38:14,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:38:14,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:38:14,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:38:14,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:38:14,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:38:14,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:38:14,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:38:14,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:38:14,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:38:14,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:38:14,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:38:14,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:38:14,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:38:14,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:38:14,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:38:14,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:38:14,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:38:14,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:38:14,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:38:14,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:38:14,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:38:14,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:38:14,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:38:14,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:38:14,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:38:14,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:38:14,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:38:14,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:38:14,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:38:14,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:38:14,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:38:14,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:38:14,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:38:14,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:38:14,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:38:14,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:38:14,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:38:14,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:38:14,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:38:14,549 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:38:14,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:38:14,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:38:14,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:38:14,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:38:14,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:38:14,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:38:14,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:38:14,551 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:38:14,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:38:14,552 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:38:14,552 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:38:14,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:38:14,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:38:14,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:38:14,553 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:38:14,553 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:38:14,553 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:38:14,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:38:14,553 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:38:14,554 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:38:14,554 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:38:14,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:38:14,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:38:14,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:38:14,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:38:14,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:38:14,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:38:14,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:38:14,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:38:14,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:38:14,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2021-12-18 21:38:14,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:38:14,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:38:14,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:38:14,802 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:38:14,802 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:38:14,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-18 21:38:14,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19f6b5a0/7e5ff22372b343d98858e9e9c58c139e/FLAG9858631ae [2021-12-18 21:38:15,211 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:38:15,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-18 21:38:15,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19f6b5a0/7e5ff22372b343d98858e9e9c58c139e/FLAG9858631ae [2021-12-18 21:38:15,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19f6b5a0/7e5ff22372b343d98858e9e9c58c139e [2021-12-18 21:38:15,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:38:15,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:38:15,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:38:15,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:38:15,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:38:15,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:15" (1/1) ... [2021-12-18 21:38:15,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785bf9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:15, skipping insertion in model container [2021-12-18 21:38:15,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:15" (1/1) ... [2021-12-18 21:38:15,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:38:15,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:38:15,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-18 21:38:15,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-18 21:38:15,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-18 21:38:15,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:38:15,940 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:38:15,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-18 21:38:15,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-18 21:38:15,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-18 21:38:15,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:38:16,015 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:38:16,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16 WrapperNode [2021-12-18 21:38:16,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:38:16,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:38:16,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:38:16,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:38:16,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,059 INFO L137 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-12-18 21:38:16,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:38:16,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:38:16,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:38:16,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:38:16,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:38:16,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:38:16,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:38:16,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:38:16,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (1/1) ... [2021-12-18 21:38:16,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:38:16,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:38:16,164 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-18 21:38:16,171 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-18 21:38:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 21:38:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 21:38:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:38:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:38:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:38:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:38:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:38:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 21:38:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:38:16,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:38:16,301 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:38:16,303 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:38:16,579 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:38:16,584 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:38:16,587 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-18 21:38:16,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:16 BoogieIcfgContainer [2021-12-18 21:38:16,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:38:16,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:38:16,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:38:16,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:38:16,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:38:15" (1/3) ... [2021-12-18 21:38:16,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21961de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:16, skipping insertion in model container [2021-12-18 21:38:16,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:16" (2/3) ... [2021-12-18 21:38:16,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21961de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:16, skipping insertion in model container [2021-12-18 21:38:16,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:16" (3/3) ... [2021-12-18 21:38:16,595 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2021-12-18 21:38:16,599 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:38:16,599 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2021-12-18 21:38:16,640 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:38:16,645 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-18 21:38:16,646 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2021-12-18 21:38:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 65 states have (on average 2.123076923076923) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:38:16,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:16,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:38:16,665 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 21:38:16,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:16,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424282279] [2021-12-18 21:38:16,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:16,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:16,833 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-18 21:38:16,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:16,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424282279] [2021-12-18 21:38:16,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424282279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:16,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:16,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:38:16,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709838738] [2021-12-18 21:38:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:16,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:38:16,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:38:16,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:16,874 INFO L87 Difference]: Start difference. First operand has 121 states, 65 states have (on average 2.123076923076923) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:17,013 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-18 21:38:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:38:17,015 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-18 21:38:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:17,023 INFO L225 Difference]: With dead ends: 123 [2021-12-18 21:38:17,023 INFO L226 Difference]: Without dead ends: 119 [2021-12-18 21:38:17,025 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-18 21:38:17,028 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:17,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 73 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-18 21:38:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-18 21:38:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 114 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2021-12-18 21:38:17,072 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 3 [2021-12-18 21:38:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:17,072 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2021-12-18 21:38:17,073 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-18 21:38:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2021-12-18 21:38:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:38:17,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:17,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:38:17,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 21:38:17,074 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 21:38:17,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:17,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435296489] [2021-12-18 21:38:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:17,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:17,149 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-18 21:38:17,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435296489] [2021-12-18 21:38:17,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435296489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:17,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:17,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:38:17,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247205336] [2021-12-18 21:38:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:17,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:38:17,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:38:17,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:17,157 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:17,268 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-18 21:38:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:38:17,269 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-18 21:38:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:17,270 INFO L225 Difference]: With dead ends: 133 [2021-12-18 21:38:17,270 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 21:38:17,270 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-18 21:38:17,271 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:17,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 78 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 21:38:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2021-12-18 21:38:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2021-12-18 21:38:17,284 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2021-12-18 21:38:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:17,285 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2021-12-18 21:38:17,286 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-18 21:38:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2021-12-18 21:38:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 21:38:17,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:17,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:17,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 21:38:17,287 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-18 21:38:17,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:17,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083631656] [2021-12-18 21:38:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:17,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:17,358 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-18 21:38:17,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:17,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083631656] [2021-12-18 21:38:17,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083631656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:17,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:17,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:38:17,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023828536] [2021-12-18 21:38:17,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:17,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:38:17,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:38:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:38:17,362 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:17,494 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-18 21:38:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:38:17,494 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-18 21:38:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:17,495 INFO L225 Difference]: With dead ends: 127 [2021-12-18 21:38:17,495 INFO L226 Difference]: Without dead ends: 127 [2021-12-18 21:38:17,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-18 21:38:17,497 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 161 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:17,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 61 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-18 21:38:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2021-12-18 21:38:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.605263157894737) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2021-12-18 21:38:17,503 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 8 [2021-12-18 21:38:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:17,503 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2021-12-18 21:38:17,503 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-18 21:38:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2021-12-18 21:38:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 21:38:17,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:17,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:17,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 21:38:17,505 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-18 21:38:17,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:17,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809885080] [2021-12-18 21:38:17,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:17,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:17,596 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-18 21:38:17,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:17,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809885080] [2021-12-18 21:38:17,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809885080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:17,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:17,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:17,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259984567] [2021-12-18 21:38:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:17,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:38:17,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:38:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:38:17,600 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:17,826 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-12-18 21:38:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:38:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-18 21:38:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:17,828 INFO L225 Difference]: With dead ends: 151 [2021-12-18 21:38:17,828 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 21:38:17,828 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-18 21:38:17,829 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 152 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:17,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 21:38:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2021-12-18 21:38:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 121 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2021-12-18 21:38:17,835 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 8 [2021-12-18 21:38:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:17,836 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2021-12-18 21:38:17,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2021-12-18 21:38:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 21:38:17,837 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:17,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:17,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 21:38:17,837 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1117785369, now seen corresponding path program 1 times [2021-12-18 21:38:17,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:17,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756435886] [2021-12-18 21:38:17,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:17,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:17,892 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-18 21:38:17,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:17,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756435886] [2021-12-18 21:38:17,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756435886] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:17,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:17,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:38:17,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923679059] [2021-12-18 21:38:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:17,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:38:17,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:38:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:38:17,895 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:17,998 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2021-12-18 21:38:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:38:17,999 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-18 21:38:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:18,000 INFO L225 Difference]: With dead ends: 136 [2021-12-18 21:38:18,000 INFO L226 Difference]: Without dead ends: 136 [2021-12-18 21:38:18,000 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-18 21:38:18,001 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 121 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:18,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 130 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-18 21:38:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2021-12-18 21:38:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-18 21:38:18,007 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 10 [2021-12-18 21:38:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:18,007 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-18 21:38:18,008 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-18 21:38:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-18 21:38:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:38:18,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:18,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:18,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 21:38:18,009 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:18,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-18 21:38:18,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:18,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061644183] [2021-12-18 21:38:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:18,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:18,059 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-18 21:38:18,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:18,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061644183] [2021-12-18 21:38:18,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061644183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:18,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:18,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:18,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680797183] [2021-12-18 21:38:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:18,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:38:18,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:18,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:38:18,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:38:18,062 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:18,235 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2021-12-18 21:38:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:38:18,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 21:38:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:18,236 INFO L225 Difference]: With dead ends: 121 [2021-12-18 21:38:18,236 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 21:38:18,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:38:18,237 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:18,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 240 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 21:38:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-12-18 21:38:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.5) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-12-18 21:38:18,242 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 12 [2021-12-18 21:38:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:18,243 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-12-18 21:38:18,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-12-18 21:38:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:38:18,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:18,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:18,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 21:38:18,244 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-18 21:38:18,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:18,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693940233] [2021-12-18 21:38:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:18,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:18,325 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-18 21:38:18,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:18,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693940233] [2021-12-18 21:38:18,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693940233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:18,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:18,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:18,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444784562] [2021-12-18 21:38:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:18,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:38:18,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:38:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:38:18,327 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:18,517 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-18 21:38:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:38:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 21:38:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:18,519 INFO L225 Difference]: With dead ends: 121 [2021-12-18 21:38:18,519 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 21:38:18,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:38:18,520 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:18,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 276 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 21:38:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2021-12-18 21:38:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2021-12-18 21:38:18,524 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 12 [2021-12-18 21:38:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:18,525 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2021-12-18 21:38:18,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2021-12-18 21:38:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:38:18,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:18,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:18,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 21:38:18,526 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1066467192, now seen corresponding path program 1 times [2021-12-18 21:38:18,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:18,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455074360] [2021-12-18 21:38:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:18,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:18,574 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-18 21:38:18,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:18,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455074360] [2021-12-18 21:38:18,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455074360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:18,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:18,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:38:18,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999211680] [2021-12-18 21:38:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:18,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:38:18,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:18,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:38:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:38:18,577 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:18,723 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2021-12-18 21:38:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:38:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 21:38:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:18,725 INFO L225 Difference]: With dead ends: 177 [2021-12-18 21:38:18,725 INFO L226 Difference]: Without dead ends: 177 [2021-12-18 21:38:18,725 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-18 21:38:18,726 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 160 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:18,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 235 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-18 21:38:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2021-12-18 21:38:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-12-18 21:38:18,731 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 13 [2021-12-18 21:38:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:18,731 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-12-18 21:38:18,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-12-18 21:38:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:38:18,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:18,732 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-18 21:38:18,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 21:38:18,733 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1154665855, now seen corresponding path program 1 times [2021-12-18 21:38:18,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:18,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668555105] [2021-12-18 21:38:18,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:18,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:18,799 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-18 21:38:18,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668555105] [2021-12-18 21:38:18,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668555105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:18,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:18,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:18,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415230693] [2021-12-18 21:38:18,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:18,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:38:18,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:18,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:38:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:38:18,802 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:18,899 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-12-18 21:38:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:38:18,900 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-18 21:38:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:18,900 INFO L225 Difference]: With dead ends: 127 [2021-12-18 21:38:18,900 INFO L226 Difference]: Without dead ends: 127 [2021-12-18 21:38:18,901 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-18 21:38:18,901 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 14 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:18,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 266 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-18 21:38:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2021-12-18 21:38:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-18 21:38:18,906 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 19 [2021-12-18 21:38:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:18,906 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-18 21:38:18,906 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-18 21:38:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-18 21:38:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:38:18,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:18,907 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-18 21:38:18,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 21:38:18,907 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1154976737, now seen corresponding path program 1 times [2021-12-18 21:38:18,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:18,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325928396] [2021-12-18 21:38:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:18,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:38:18,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 21:38:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:38:18,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 21:38:18,942 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 21:38:18,943 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2021-12-18 21:38:18,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (53 of 55 remaining) [2021-12-18 21:38:18,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (52 of 55 remaining) [2021-12-18 21:38:18,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (51 of 55 remaining) [2021-12-18 21:38:18,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (50 of 55 remaining) [2021-12-18 21:38:18,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (49 of 55 remaining) [2021-12-18 21:38:18,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (48 of 55 remaining) [2021-12-18 21:38:18,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (47 of 55 remaining) [2021-12-18 21:38:18,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (46 of 55 remaining) [2021-12-18 21:38:18,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (45 of 55 remaining) [2021-12-18 21:38:18,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (44 of 55 remaining) [2021-12-18 21:38:18,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (43 of 55 remaining) [2021-12-18 21:38:18,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (42 of 55 remaining) [2021-12-18 21:38:18,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (41 of 55 remaining) [2021-12-18 21:38:18,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (40 of 55 remaining) [2021-12-18 21:38:18,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (39 of 55 remaining) [2021-12-18 21:38:18,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (38 of 55 remaining) [2021-12-18 21:38:18,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (37 of 55 remaining) [2021-12-18 21:38:18,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (36 of 55 remaining) [2021-12-18 21:38:18,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (35 of 55 remaining) [2021-12-18 21:38:18,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (34 of 55 remaining) [2021-12-18 21:38:18,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (33 of 55 remaining) [2021-12-18 21:38:18,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (32 of 55 remaining) [2021-12-18 21:38:18,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2021-12-18 21:38:18,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (30 of 55 remaining) [2021-12-18 21:38:18,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (29 of 55 remaining) [2021-12-18 21:38:18,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2021-12-18 21:38:18,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (27 of 55 remaining) [2021-12-18 21:38:18,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (26 of 55 remaining) [2021-12-18 21:38:18,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (25 of 55 remaining) [2021-12-18 21:38:18,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (24 of 55 remaining) [2021-12-18 21:38:18,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 55 remaining) [2021-12-18 21:38:18,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 55 remaining) [2021-12-18 21:38:18,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 55 remaining) [2021-12-18 21:38:18,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 55 remaining) [2021-12-18 21:38:18,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (19 of 55 remaining) [2021-12-18 21:38:18,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (18 of 55 remaining) [2021-12-18 21:38:18,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (17 of 55 remaining) [2021-12-18 21:38:18,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (16 of 55 remaining) [2021-12-18 21:38:18,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (15 of 55 remaining) [2021-12-18 21:38:18,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (14 of 55 remaining) [2021-12-18 21:38:18,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2021-12-18 21:38:18,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2021-12-18 21:38:18,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2021-12-18 21:38:18,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (10 of 55 remaining) [2021-12-18 21:38:18,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (9 of 55 remaining) [2021-12-18 21:38:18,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2021-12-18 21:38:18,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2021-12-18 21:38:18,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2021-12-18 21:38:18,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (5 of 55 remaining) [2021-12-18 21:38:18,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (4 of 55 remaining) [2021-12-18 21:38:18,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2021-12-18 21:38:18,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2021-12-18 21:38:18,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2021-12-18 21:38:18,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2021-12-18 21:38:18,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 21:38:18,956 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:18,959 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:38:18,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:38:18 BoogieIcfgContainer [2021-12-18 21:38:18,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:38:18,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:38:18,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:38:18,978 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:38:18,978 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:16" (3/4) ... [2021-12-18 21:38:18,981 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 21:38:18,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:38:18,981 INFO L158 Benchmark]: Toolchain (without parser) took 3386.52ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 59.5MB in the beginning and 61.6MB in the end (delta: -2.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2021-12-18 21:38:18,982 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:38:18,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.80ms. Allocated memory is still 100.7MB. Free memory was 59.3MB in the beginning and 67.9MB in the end (delta: -8.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2021-12-18 21:38:18,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.29ms. Allocated memory is still 100.7MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:38:18,983 INFO L158 Benchmark]: Boogie Preprocessor took 58.38ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:38:18,983 INFO L158 Benchmark]: RCFGBuilder took 464.08ms. Allocated memory is still 100.7MB. Free memory was 64.0MB in the beginning and 46.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-18 21:38:18,983 INFO L158 Benchmark]: TraceAbstraction took 2387.63ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 45.8MB in the beginning and 61.6MB in the end (delta: -15.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-18 21:38:18,983 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 121.6MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:38:18,985 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.19ms. Allocated memory is still 100.7MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.80ms. Allocated memory is still 100.7MB. Free memory was 59.3MB in the beginning and 67.9MB in the end (delta: -8.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.29ms. Allocated memory is still 100.7MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.38ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.08ms. Allocated memory is still 100.7MB. Free memory was 64.0MB in the beginning and 46.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2387.63ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 45.8MB in the beginning and 61.6MB in the end (delta: -15.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 121.6MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK VAL [list={-1:0}] [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1043] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 121 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 1474 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 848 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1369 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 626 mSDtfsCounter, 1369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=4, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 149 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 21:38:19,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:38:20,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:38:20,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:38:20,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:38:20,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:38:20,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:38:20,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:38:20,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:38:20,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:38:20,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:38:20,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:38:20,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:38:20,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:38:20,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:38:20,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:38:20,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:38:20,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:38:20,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:38:20,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:38:20,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:38:20,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:38:20,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:38:20,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:38:20,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:38:20,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:38:20,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:38:20,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:38:20,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:38:20,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:38:20,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:38:20,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:38:20,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:38:20,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:38:20,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:38:20,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:38:20,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:38:20,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:38:20,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:38:20,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:38:20,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:38:20,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:38:20,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 21:38:20,917 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:38:20,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:38:20,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:38:20,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:38:20,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:38:20,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:38:20,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:38:20,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:38:20,926 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:38:20,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:38:20,927 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:38:20,927 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:38:20,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:38:20,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:38:20,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:38:20,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:38:20,928 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:38:20,928 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:38:20,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:38:20,929 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:38:20,929 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 21:38:20,929 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 21:38:20,929 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:38:20,929 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:38:20,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:38:20,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:38:20,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:38:20,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:38:20,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:38:20,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:38:20,931 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 21:38:20,931 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 21:38:20,931 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:38:20,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 21:38:20,932 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2021-12-18 21:38:21,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:38:21,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:38:21,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:38:21,251 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:38:21,252 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:38:21,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-18 21:38:21,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539106c00/99abd8bdfb6146a0abe621bc4777b042/FLAG0e18880a9 [2021-12-18 21:38:21,804 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:38:21,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-18 21:38:21,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539106c00/99abd8bdfb6146a0abe621bc4777b042/FLAG0e18880a9 [2021-12-18 21:38:22,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539106c00/99abd8bdfb6146a0abe621bc4777b042 [2021-12-18 21:38:22,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:38:22,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:38:22,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:38:22,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:38:22,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:38:22,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544942fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22, skipping insertion in model container [2021-12-18 21:38:22,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:38:22,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:38:22,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-18 21:38:22,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-18 21:38:22,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-18 21:38:22,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:38:22,484 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:38:22,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-18 21:38:22,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-18 21:38:22,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-18 21:38:22,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:38:22,550 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:38:22,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22 WrapperNode [2021-12-18 21:38:22,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:38:22,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:38:22,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:38:22,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:38:22,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,589 INFO L137 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2021-12-18 21:38:22,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:38:22,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:38:22,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:38:22,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:38:22,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:38:22,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:38:22,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:38:22,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:38:22,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (1/1) ... [2021-12-18 21:38:22,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:38:22,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:38:22,650 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-18 21:38:22,669 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-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 21:38:22,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 21:38:22,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:38:22,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:38:22,796 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:38:22,797 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:38:23,275 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:38:23,280 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:38:23,281 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-18 21:38:23,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:23 BoogieIcfgContainer [2021-12-18 21:38:23,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:38:23,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:38:23,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:38:23,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:38:23,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:38:22" (1/3) ... [2021-12-18 21:38:23,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f0e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:23, skipping insertion in model container [2021-12-18 21:38:23,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:22" (2/3) ... [2021-12-18 21:38:23,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f0e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:23, skipping insertion in model container [2021-12-18 21:38:23,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:23" (3/3) ... [2021-12-18 21:38:23,291 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2021-12-18 21:38:23,295 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:38:23,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2021-12-18 21:38:23,339 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:38:23,347 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-18 21:38:23,348 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2021-12-18 21:38:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:38:23,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:23,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:38:23,377 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 21:38:23,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:23,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857976889] [2021-12-18 21:38:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:23,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:23,403 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-18 21:38:23,410 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-18 21:38:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:23,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 21:38:23,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:23,545 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-18 21:38:23,555 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-18 21:38:23,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:23,557 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:23,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857976889] [2021-12-18 21:38:23,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857976889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:23,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:23,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:38:23,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484616840] [2021-12-18 21:38:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:23,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:38:23,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:23,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:38:23,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:23,594 INFO L87 Difference]: Start difference. First operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:23,771 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-18 21:38:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:38:23,773 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-18 21:38:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:23,780 INFO L225 Difference]: With dead ends: 121 [2021-12-18 21:38:23,780 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 21:38:23,781 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-18 21:38:23,784 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:23,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 71 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 21:38:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2021-12-18 21:38:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.875) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-18 21:38:23,813 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 3 [2021-12-18 21:38:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:23,814 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-18 21:38:23,814 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-18 21:38:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-18 21:38:23,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:38:23,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:23,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:38:23,830 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-18 21:38:24,029 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-18 21:38:24,030 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 21:38:24,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:24,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403262971] [2021-12-18 21:38:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:24,032 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:24,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:24,033 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-18 21:38:24,036 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-18 21:38:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:24,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:38:24,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:24,091 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-18 21:38:24,100 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-18 21:38:24,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:24,101 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:24,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403262971] [2021-12-18 21:38:24,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403262971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:24,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:24,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:38:24,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864263169] [2021-12-18 21:38:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:24,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:38:24,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:38:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:24,104 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:24,332 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2021-12-18 21:38:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:38:24,333 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-18 21:38:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:24,334 INFO L225 Difference]: With dead ends: 131 [2021-12-18 21:38:24,334 INFO L226 Difference]: Without dead ends: 131 [2021-12-18 21:38:24,335 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-18 21:38:24,336 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:24,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-18 21:38:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-12-18 21:38:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 117 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-12-18 21:38:24,344 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 3 [2021-12-18 21:38:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:24,344 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-12-18 21:38:24,345 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-18 21:38:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-12-18 21:38:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 21:38:24,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:24,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:24,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-18 21:38:24,546 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-18 21:38:24,546 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-18 21:38:24,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:24,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330197553] [2021-12-18 21:38:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:24,548 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:24,549 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-18 21:38:24,551 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-18 21:38:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:24,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:38:24,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:24,632 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-18 21:38:24,678 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-18 21:38:24,679 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 15 treesize of output 20 [2021-12-18 21:38:24,690 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-18 21:38:24,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:24,691 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:24,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330197553] [2021-12-18 21:38:24,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330197553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:24,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:24,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:38:24,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476935628] [2021-12-18 21:38:24,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:24,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:38:24,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:38:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:38:24,694 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:24,961 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-18 21:38:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:38:24,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 21:38:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:24,963 INFO L225 Difference]: With dead ends: 125 [2021-12-18 21:38:24,963 INFO L226 Difference]: Without dead ends: 125 [2021-12-18 21:38:24,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:38:24,964 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 158 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:24,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 59 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:38:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-18 21:38:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2021-12-18 21:38:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-18 21:38:24,976 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 7 [2021-12-18 21:38:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:24,978 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-18 21:38:24,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-18 21:38:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 21:38:24,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:24,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:24,995 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-18 21:38:25,193 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-18 21:38:25,193 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-18 21:38:25,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:25,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81254575] [2021-12-18 21:38:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:25,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:25,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:25,196 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-18 21:38:25,198 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-18 21:38:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:25,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:38:25,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:25,275 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-18 21:38:25,344 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:38:25,344 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-18 21:38:25,359 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-18 21:38:25,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:25,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:25,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81254575] [2021-12-18 21:38:25,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81254575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:25,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:25,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:38:25,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570805358] [2021-12-18 21:38:25,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:25,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:38:25,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:25,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:38:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:38:25,362 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:25,665 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2021-12-18 21:38:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:38:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 21:38:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:25,667 INFO L225 Difference]: With dead ends: 148 [2021-12-18 21:38:25,667 INFO L226 Difference]: Without dead ends: 148 [2021-12-18 21:38:25,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:38:25,668 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 147 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:25,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 85 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:38:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-18 21:38:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-12-18 21:38:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2021-12-18 21:38:25,681 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 7 [2021-12-18 21:38:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:25,682 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2021-12-18 21:38:25,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2021-12-18 21:38:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 21:38:25,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:25,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:25,698 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-18 21:38:25,903 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-18 21:38:25,904 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:25,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1837273936, now seen corresponding path program 1 times [2021-12-18 21:38:25,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:25,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676746351] [2021-12-18 21:38:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:25,905 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:25,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:25,906 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-18 21:38:25,908 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-18 21:38:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:25,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 21:38:25,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:25,981 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-18 21:38:25,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:25,981 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:25,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676746351] [2021-12-18 21:38:25,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676746351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:25,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:25,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:38:25,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831376237] [2021-12-18 21:38:25,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:25,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:38:25,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:38:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:38:25,983 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:26,176 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2021-12-18 21:38:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:38:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 21:38:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:26,178 INFO L225 Difference]: With dead ends: 133 [2021-12-18 21:38:26,178 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 21:38:26,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:38:26,179 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 119 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:26,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 126 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 21:38:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2021-12-18 21:38:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2021-12-18 21:38:26,186 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 9 [2021-12-18 21:38:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:26,186 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2021-12-18 21:38:26,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2021-12-18 21:38:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:38:26,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:26,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:26,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-18 21:38:26,394 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-18 21:38:26,395 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-18 21:38:26,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:26,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577987990] [2021-12-18 21:38:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:26,396 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:26,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:26,397 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-18 21:38:26,398 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-18 21:38:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:26,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:38:26,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:26,490 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-18 21:38:26,508 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-18 21:38:26,528 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 20 treesize of output 12 [2021-12-18 21:38:26,544 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-18 21:38:26,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:26,544 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:26,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577987990] [2021-12-18 21:38:26,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577987990] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:26,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:26,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:26,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566868015] [2021-12-18 21:38:26,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:26,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:38:26,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:26,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:38:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:38:26,546 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:26,899 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-12-18 21:38:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:38:26,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 21:38:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:26,900 INFO L225 Difference]: With dead ends: 118 [2021-12-18 21:38:26,900 INFO L226 Difference]: Without dead ends: 118 [2021-12-18 21:38:26,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:38:26,901 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:26,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 227 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:38:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-18 21:38:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2021-12-18 21:38:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 115 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2021-12-18 21:38:26,907 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 11 [2021-12-18 21:38:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:26,907 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2021-12-18 21:38:26,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2021-12-18 21:38:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:38:26,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:26,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:26,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:38:27,117 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-18 21:38:27,118 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-18 21:38:27,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596208126] [2021-12-18 21:38:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:27,118 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:27,119 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-18 21:38:27,120 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-18 21:38:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:27,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 21:38:27,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:27,202 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-18 21:38:27,224 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-18 21:38:27,229 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-18 21:38:27,268 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-18 21:38:27,272 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-18 21:38:27,305 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-18 21:38:27,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:27,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:27,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596208126] [2021-12-18 21:38:27,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596208126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:27,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:27,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:27,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473122931] [2021-12-18 21:38:27,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:27,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:38:27,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:38:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:38:27,307 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:27,721 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2021-12-18 21:38:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:38:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 21:38:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:27,722 INFO L225 Difference]: With dead ends: 117 [2021-12-18 21:38:27,722 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 21:38:27,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:38:27,723 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:27,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 263 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:38:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 21:38:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2021-12-18 21:38:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-12-18 21:38:27,728 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 11 [2021-12-18 21:38:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:27,728 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-12-18 21:38:27,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-12-18 21:38:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:38:27,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:27,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:27,740 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-18 21:38:27,937 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-18 21:38:27,937 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash -831409633, now seen corresponding path program 1 times [2021-12-18 21:38:27,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:27,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384387149] [2021-12-18 21:38:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:27,938 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:27,939 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-18 21:38:27,941 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-18 21:38:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:27,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:38:27,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:28,001 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-18 21:38:28,039 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-18 21:38:28,048 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-18 21:38:28,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:28,049 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:28,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384387149] [2021-12-18 21:38:28,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384387149] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:28,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:28,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:28,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518209254] [2021-12-18 21:38:28,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:28,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:38:28,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:28,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:38:28,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:38:28,051 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:28,298 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2021-12-18 21:38:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:38:28,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 21:38:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:28,300 INFO L225 Difference]: With dead ends: 173 [2021-12-18 21:38:28,300 INFO L226 Difference]: Without dead ends: 173 [2021-12-18 21:38:28,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:38:28,301 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 81 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:28,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 217 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-18 21:38:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2021-12-18 21:38:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 116 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2021-12-18 21:38:28,305 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2021-12-18 21:38:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:28,306 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2021-12-18 21:38:28,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2021-12-18 21:38:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 21:38:28,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:28,307 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:28,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:38:28,515 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-18 21:38:28,516 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1081092570, now seen corresponding path program 1 times [2021-12-18 21:38:28,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:28,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693113093] [2021-12-18 21:38:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:28,516 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:28,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:28,518 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-18 21:38:28,518 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-18 21:38:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:28,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:38:28,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:28,582 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-18 21:38:28,643 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-18 21:38:28,661 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-18 21:38:28,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:28,661 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693113093] [2021-12-18 21:38:28,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693113093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:28,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:28,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:38:28,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872977233] [2021-12-18 21:38:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:28,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:38:28,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:38:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:38:28,663 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:28,904 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2021-12-18 21:38:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:38:28,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 21:38:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:28,906 INFO L225 Difference]: With dead ends: 171 [2021-12-18 21:38:28,906 INFO L226 Difference]: Without dead ends: 171 [2021-12-18 21:38:28,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:38:28,908 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 72 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:28,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 219 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-18 21:38:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2021-12-18 21:38:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-12-18 21:38:28,921 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 18 [2021-12-18 21:38:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:28,922 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-12-18 21:38:28,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-12-18 21:38:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 21:38:28,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:28,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:28,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:38:29,127 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-18 21:38:29,128 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-18 21:38:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1080781688, now seen corresponding path program 1 times [2021-12-18 21:38:29,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:29,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803042234] [2021-12-18 21:38:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:29,128 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:29,129 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-18 21:38:29,132 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-18 21:38:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:38:29,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 21:38:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:38:29,235 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-18 21:38:29,235 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 21:38:29,236 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (53 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (52 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (51 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (50 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (49 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (48 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (47 of 55 remaining) [2021-12-18 21:38:29,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (46 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (45 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (44 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (43 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (42 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (41 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (40 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (39 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (38 of 55 remaining) [2021-12-18 21:38:29,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (37 of 55 remaining) [2021-12-18 21:38:29,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (36 of 55 remaining) [2021-12-18 21:38:29,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (35 of 55 remaining) [2021-12-18 21:38:29,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (34 of 55 remaining) [2021-12-18 21:38:29,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (33 of 55 remaining) [2021-12-18 21:38:29,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (32 of 55 remaining) [2021-12-18 21:38:29,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2021-12-18 21:38:29,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (30 of 55 remaining) [2021-12-18 21:38:29,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (29 of 55 remaining) [2021-12-18 21:38:29,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2021-12-18 21:38:29,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (27 of 55 remaining) [2021-12-18 21:38:29,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (26 of 55 remaining) [2021-12-18 21:38:29,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (25 of 55 remaining) [2021-12-18 21:38:29,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (24 of 55 remaining) [2021-12-18 21:38:29,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 55 remaining) [2021-12-18 21:38:29,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 55 remaining) [2021-12-18 21:38:29,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 55 remaining) [2021-12-18 21:38:29,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 55 remaining) [2021-12-18 21:38:29,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (19 of 55 remaining) [2021-12-18 21:38:29,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (18 of 55 remaining) [2021-12-18 21:38:29,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (17 of 55 remaining) [2021-12-18 21:38:29,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (16 of 55 remaining) [2021-12-18 21:38:29,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (15 of 55 remaining) [2021-12-18 21:38:29,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (14 of 55 remaining) [2021-12-18 21:38:29,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2021-12-18 21:38:29,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2021-12-18 21:38:29,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2021-12-18 21:38:29,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (10 of 55 remaining) [2021-12-18 21:38:29,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (9 of 55 remaining) [2021-12-18 21:38:29,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2021-12-18 21:38:29,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2021-12-18 21:38:29,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2021-12-18 21:38:29,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (5 of 55 remaining) [2021-12-18 21:38:29,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (4 of 55 remaining) [2021-12-18 21:38:29,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2021-12-18 21:38:29,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2021-12-18 21:38:29,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2021-12-18 21:38:29,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2021-12-18 21:38:29,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-18 21:38:29,479 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-18 21:38:29,482 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:29,484 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:38:29,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:38:29 BoogieIcfgContainer [2021-12-18 21:38:29,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:38:29,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:38:29,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:38:29,506 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:38:29,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:23" (3/4) ... [2021-12-18 21:38:29,508 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 21:38:29,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:38:29,509 INFO L158 Benchmark]: Toolchain (without parser) took 7355.21ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 34.0MB in the beginning and 64.5MB in the end (delta: -30.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:38:29,509 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 56.6MB. Free memory is still 39.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:38:29,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.19ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 49.5MB in the end (delta: -15.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 21:38:29,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.35ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 47.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:38:29,510 INFO L158 Benchmark]: Boogie Preprocessor took 29.09ms. Allocated memory is still 73.4MB. Free memory was 47.2MB in the beginning and 45.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:38:29,510 INFO L158 Benchmark]: RCFGBuilder took 661.98ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 42.8MB in the end (delta: 2.5MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2021-12-18 21:38:29,511 INFO L158 Benchmark]: TraceAbstraction took 6220.07ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 42.5MB in the beginning and 64.5MB in the end (delta: -22.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2021-12-18 21:38:29,511 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 88.1MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:38:29,512 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.45ms. Allocated memory is still 56.6MB. Free memory is still 39.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.19ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 49.5MB in the end (delta: -15.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.35ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 47.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.09ms. Allocated memory is still 73.4MB. Free memory was 47.2MB in the beginning and 45.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 661.98ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 42.8MB in the end (delta: 2.5MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6220.07ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 42.5MB in the beginning and 64.5MB in the end (delta: -22.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 88.1MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK VAL [list={6:0}] [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={6:0}, list={6:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1039] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1043] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={6:0}, end->next={0:0}, list={6:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={6:0}, list={6:0}] - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 837 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 1343 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 592 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 191 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 411 SizeOfPredicates, 26 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 21:38:29,551 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