./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-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 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:46:50,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:46:50,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:46:51,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:46:51,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:46:51,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:46:51,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:46:51,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:46:51,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:46:51,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:46:51,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:46:51,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:46:51,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:46:51,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:46:51,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:46:51,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:46:51,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:46:51,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:46:51,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:46:51,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:46:51,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:46:51,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:46:51,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:46:51,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:46:51,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:46:51,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:46:51,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:46:51,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:46:51,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:46:51,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:46:51,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:46:51,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:46:51,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:46:51,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:46:51,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:46:51,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:46:51,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:46:51,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:46:51,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:46:51,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:46:51,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:46:51,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:46:51,101 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:46:51,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:46:51,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:46:51,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:46:51,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:46:51,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:46:51,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:46:51,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:46:51,103 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:46:51,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:46:51,104 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:46:51,104 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:46:51,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:46:51,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:46:51,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:46:51,105 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:46:51,105 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:46:51,105 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:46:51,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:46:51,106 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:46:51,106 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:46:51,106 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:46:51,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:46:51,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:46:51,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:46:51,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:51,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:46:51,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:46:51,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:46:51,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:46:51,109 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:46:51,109 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 -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2021-12-14 19:46:51,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:46:51,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:46:51,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:46:51,326 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:46:51,326 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:46:51,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-14 19:46:51,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b361af033/00cad22f49c94c60877594baa779f48f/FLAG956278c1c [2021-12-14 19:46:51,758 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:46:51,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-14 19:46:51,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b361af033/00cad22f49c94c60877594baa779f48f/FLAG956278c1c [2021-12-14 19:46:51,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b361af033/00cad22f49c94c60877594baa779f48f [2021-12-14 19:46:51,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:46:51,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:46:51,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:51,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:46:51,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:46:51,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:51" (1/1) ... [2021-12-14 19:46:51,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1403f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:51, skipping insertion in model container [2021-12-14 19:46:51,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:51" (1/1) ... [2021-12-14 19:46:51,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:46:51,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:46:52,011 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-sorted-2.i[22317,22330] [2021-12-14 19:46:52,016 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-sorted-2.i[22452,22465] [2021-12-14 19:46:52,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2021-12-14 19:46:52,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22941,22954] [2021-12-14 19:46:52,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2021-12-14 19:46:52,029 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-sorted-2.i[23136,23149] [2021-12-14 19:46:52,030 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-sorted-2.i[23200,23213] [2021-12-14 19:46:52,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:52,044 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:46:52,080 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-sorted-2.i[22317,22330] [2021-12-14 19:46:52,081 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-sorted-2.i[22452,22465] [2021-12-14 19:46:52,082 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-sorted-2.i[22612,22625] [2021-12-14 19:46:52,084 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-sorted-2.i[22941,22954] [2021-12-14 19:46:52,085 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-sorted-2.i[23005,23018] [2021-12-14 19:46:52,086 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-sorted-2.i[23136,23149] [2021-12-14 19:46:52,086 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-sorted-2.i[23200,23213] [2021-12-14 19:46:52,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:52,111 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:46:52,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52 WrapperNode [2021-12-14 19:46:52,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:52,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:52,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:46:52,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:46:52,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,175 INFO L137 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2021-12-14 19:46:52,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:52,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:46:52,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:46:52,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:46:52,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:46:52,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:46:52,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:46:52,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:46:52,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (1/1) ... [2021-12-14 19:46:52,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:52,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:52,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:46:52,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:46:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:46:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:46:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:46:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:46:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:46:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:46:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:46:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:46:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:46:52,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:46:52,336 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:46:52,337 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:46:52,639 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:46:52,649 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:46:52,649 INFO L301 CfgBuilder]: Removed 20 assume(true) statements. [2021-12-14 19:46:52,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:52 BoogieIcfgContainer [2021-12-14 19:46:52,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:46:52,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:46:52,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:46:52,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:46:52,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:46:51" (1/3) ... [2021-12-14 19:46:52,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb7a625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:52, skipping insertion in model container [2021-12-14 19:46:52,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:52" (2/3) ... [2021-12-14 19:46:52,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb7a625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:52, skipping insertion in model container [2021-12-14 19:46:52,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:52" (3/3) ... [2021-12-14 19:46:52,658 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2021-12-14 19:46:52,662 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:46:52,662 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-12-14 19:46:52,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:46:52,697 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:46:52,697 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-12-14 19:46:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:52,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:52,723 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:52,724 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:46:52,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:52,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693791506] [2021-12-14 19:46:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:52,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:52,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:52,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693791506] [2021-12-14 19:46:52,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693791506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:52,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:52,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:52,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790684350] [2021-12-14 19:46:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:52,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:52,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:52,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:52,886 INFO L87 Difference]: Start difference. First operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:53,016 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2021-12-14 19:46:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-14 19:46:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:53,028 INFO L225 Difference]: With dead ends: 170 [2021-12-14 19:46:53,028 INFO L226 Difference]: Without dead ends: 166 [2021-12-14 19:46:53,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:53,031 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:53,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-14 19:46:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2021-12-14 19:46:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2021-12-14 19:46:53,061 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 3 [2021-12-14 19:46:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:53,062 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2021-12-14 19:46:53,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2021-12-14 19:46:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:53,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:53,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:53,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:46:53,063 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:46:53,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:53,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834442541] [2021-12-14 19:46:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:53,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:53,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:53,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834442541] [2021-12-14 19:46:53,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834442541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:53,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:53,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:53,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532517391] [2021-12-14 19:46:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:53,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:53,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:53,129 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:53,218 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2021-12-14 19:46:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-14 19:46:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:53,222 INFO L225 Difference]: With dead ends: 164 [2021-12-14 19:46:53,223 INFO L226 Difference]: Without dead ends: 164 [2021-12-14 19:46:53,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:53,224 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 156 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:53,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 114 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-14 19:46:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2021-12-14 19:46:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 93 states have (on average 1.8387096774193548) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2021-12-14 19:46:53,232 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 3 [2021-12-14 19:46:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:53,232 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2021-12-14 19:46:53,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2021-12-14 19:46:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:46:53,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:53,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:53,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:46:53,233 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-14 19:46:53,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:53,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518370102] [2021-12-14 19:46:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:53,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:53,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:53,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518370102] [2021-12-14 19:46:53,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518370102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:53,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:53,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:53,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542327] [2021-12-14 19:46:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:53,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:53,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:53,291 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:53,417 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2021-12-14 19:46:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:46:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 19:46:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:53,419 INFO L225 Difference]: With dead ends: 168 [2021-12-14 19:46:53,419 INFO L226 Difference]: Without dead ends: 168 [2021-12-14 19:46:53,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:53,420 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 276 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:53,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 88 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-14 19:46:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2021-12-14 19:46:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.6728971962616823) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2021-12-14 19:46:53,427 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 8 [2021-12-14 19:46:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:53,427 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2021-12-14 19:46:53,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2021-12-14 19:46:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:46:53,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:53,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:53,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:46:53,429 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:53,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-14 19:46:53,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:53,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771576458] [2021-12-14 19:46:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:53,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:53,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:53,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771576458] [2021-12-14 19:46:53,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771576458] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:53,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:53,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:53,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443970132] [2021-12-14 19:46:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:53,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:53,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:53,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:53,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:53,497 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:53,699 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2021-12-14 19:46:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:53,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 19:46:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:53,701 INFO L225 Difference]: With dead ends: 240 [2021-12-14 19:46:53,701 INFO L226 Difference]: Without dead ends: 240 [2021-12-14 19:46:53,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:53,702 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 315 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:53,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 146 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-14 19:46:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 206. [2021-12-14 19:46:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 156 states have (on average 1.5705128205128205) internal successors, (245), 205 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 245 transitions. [2021-12-14 19:46:53,709 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 245 transitions. Word has length 8 [2021-12-14 19:46:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:53,710 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 245 transitions. [2021-12-14 19:46:53,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 245 transitions. [2021-12-14 19:46:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:46:53,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:53,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:53,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:46:53,711 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1117776432, now seen corresponding path program 1 times [2021-12-14 19:46:53,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:53,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805348785] [2021-12-14 19:46:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:53,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:53,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805348785] [2021-12-14 19:46:53,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805348785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:53,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:53,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:53,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723601863] [2021-12-14 19:46:53,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:53,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:53,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:53,737 INFO L87 Difference]: Start difference. First operand 206 states and 245 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:53,750 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2021-12-14 19:46:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-14 19:46:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:53,752 INFO L225 Difference]: With dead ends: 246 [2021-12-14 19:46:53,752 INFO L226 Difference]: Without dead ends: 246 [2021-12-14 19:46:53,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:53,753 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 111 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:53,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 217 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:46:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-14 19:46:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2021-12-14 19:46:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 166 states have (on average 1.5602409638554218) internal successors, (259), 215 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2021-12-14 19:46:53,759 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 10 [2021-12-14 19:46:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:53,759 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2021-12-14 19:46:53,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2021-12-14 19:46:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:46:53,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:53,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:53,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:46:53,760 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-14 19:46:53,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046424082] [2021-12-14 19:46:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:53,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:53,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:53,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046424082] [2021-12-14 19:46:53,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046424082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:53,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:53,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:53,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012824105] [2021-12-14 19:46:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:53,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:53,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:53,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:53,824 INFO L87 Difference]: Start difference. First operand 216 states and 259 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-14 19:46:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:54,005 INFO L93 Difference]: Finished difference Result 222 states and 264 transitions. [2021-12-14 19:46:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:54,006 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-14 19:46:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:54,006 INFO L225 Difference]: With dead ends: 222 [2021-12-14 19:46:54,006 INFO L226 Difference]: Without dead ends: 222 [2021-12-14 19:46:54,007 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-14 19:46:54,007 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 106 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:54,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 372 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-14 19:46:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2021-12-14 19:46:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 166 states have (on average 1.5481927710843373) internal successors, (257), 214 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 257 transitions. [2021-12-14 19:46:54,012 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 257 transitions. Word has length 12 [2021-12-14 19:46:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:54,012 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 257 transitions. [2021-12-14 19:46:54,012 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-14 19:46:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 257 transitions. [2021-12-14 19:46:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:46:54,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:54,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:54,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:46:54,013 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-14 19:46:54,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:54,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056598113] [2021-12-14 19:46:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:54,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:54,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:54,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056598113] [2021-12-14 19:46:54,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056598113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:54,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:54,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:54,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380501976] [2021-12-14 19:46:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:54,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:54,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:54,083 INFO L87 Difference]: Start difference. First operand 215 states and 257 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-14 19:46:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:54,278 INFO L93 Difference]: Finished difference Result 211 states and 250 transitions. [2021-12-14 19:46:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:46:54,279 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-14 19:46:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:54,280 INFO L225 Difference]: With dead ends: 211 [2021-12-14 19:46:54,280 INFO L226 Difference]: Without dead ends: 211 [2021-12-14 19:46:54,280 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-14 19:46:54,280 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 15 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:54,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 456 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-14 19:46:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2021-12-14 19:46:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 161 states have (on average 1.515527950310559) internal successors, (244), 204 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2021-12-14 19:46:54,285 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 12 [2021-12-14 19:46:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:54,285 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2021-12-14 19:46:54,285 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-14 19:46:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2021-12-14 19:46:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 19:46:54,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:54,285 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:54,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:46:54,286 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1270421215, now seen corresponding path program 1 times [2021-12-14 19:46:54,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:54,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561840550] [2021-12-14 19:46:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:54,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:46:54,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:54,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561840550] [2021-12-14 19:46:54,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561840550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:54,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:54,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:54,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576622896] [2021-12-14 19:46:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:54,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:54,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:54,344 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:54,461 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2021-12-14 19:46:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:54,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 19:46:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:54,462 INFO L225 Difference]: With dead ends: 237 [2021-12-14 19:46:54,462 INFO L226 Difference]: Without dead ends: 237 [2021-12-14 19:46:54,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:54,463 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 283 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:54,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 196 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-14 19:46:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2021-12-14 19:46:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.5) internal successors, (240), 202 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 240 transitions. [2021-12-14 19:46:54,466 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 240 transitions. Word has length 21 [2021-12-14 19:46:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:54,467 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 240 transitions. [2021-12-14 19:46:54,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 240 transitions. [2021-12-14 19:46:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:46:54,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:54,468 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:54,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:46:54,468 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -697189136, now seen corresponding path program 1 times [2021-12-14 19:46:54,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:54,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077239233] [2021-12-14 19:46:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:54,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:54,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:54,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077239233] [2021-12-14 19:46:54,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077239233] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:54,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108145982] [2021-12-14 19:46:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:54,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:54,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:54,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:46:54,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:46:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:54,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-14 19:46:54,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:54,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:54,972 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:46:54,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:46:55,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:46:55,139 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:55,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:46:55,221 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:55,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:46:55,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:55,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:46:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:55,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:55,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:55,741 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-14 19:46:55,755 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:55,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-14 19:46:55,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2021-12-14 19:46:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:56,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108145982] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:46:56,631 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:46:56,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-14 19:46:56,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088532931] [2021-12-14 19:46:56,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:46:56,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 19:46:56,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 19:46:56,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=741, Unknown=6, NotChecked=0, Total=870 [2021-12-14 19:46:56,636 INFO L87 Difference]: Start difference. First operand 203 states and 240 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:57,612 INFO L93 Difference]: Finished difference Result 660 states and 757 transitions. [2021-12-14 19:46:57,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:46:57,613 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 27 [2021-12-14 19:46:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:57,614 INFO L225 Difference]: With dead ends: 660 [2021-12-14 19:46:57,614 INFO L226 Difference]: Without dead ends: 660 [2021-12-14 19:46:57,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=359, Invalid=1705, Unknown=6, NotChecked=0, Total=2070 [2021-12-14 19:46:57,615 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 1340 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:57,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1340 Valid, 1400 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1055 Invalid, 0 Unknown, 1153 Unchecked, 0.5s Time] [2021-12-14 19:46:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-12-14 19:46:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 225. [2021-12-14 19:46:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.467032967032967) internal successors, (267), 224 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2021-12-14 19:46:57,623 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 27 [2021-12-14 19:46:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:57,623 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2021-12-14 19:46:57,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2021-12-14 19:46:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:46:57,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:57,625 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:57,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 19:46:57,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:57,842 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:46:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash -697189135, now seen corresponding path program 1 times [2021-12-14 19:46:57,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:57,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597432726] [2021-12-14 19:46:57,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:57,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:58,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:58,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597432726] [2021-12-14 19:46:58,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597432726] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:58,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062382267] [2021-12-14 19:46:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:58,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:58,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:58,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:46:58,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:46:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:58,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-14 19:46:58,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:58,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:58,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:58,454 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:58,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:46:58,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:46:58,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:46:58,648 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:46:58,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 19:46:58,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-14 19:46:58,682 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:58,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:46:58,746 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:58,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:46:58,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:46:58,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:58,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:46:58,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:58,890 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:58,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-14 19:46:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:58,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:59,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:59,601 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2021-12-14 19:46:59,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:59,607 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2021-12-14 19:46:59,614 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:59,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2021-12-14 19:46:59,621 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:59,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 120 [2021-12-14 19:46:59,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 89 treesize of output 85 [2021-12-14 19:46:59,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 85 treesize of output 81 [2021-12-14 19:46:59,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 81 treesize of output 79 [2021-12-14 19:47:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:00,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062382267] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:47:00,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:47:00,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-12-14 19:47:00,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818190055] [2021-12-14 19:47:00,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:00,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-14 19:47:00,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-14 19:47:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=879, Unknown=9, NotChecked=0, Total=992 [2021-12-14 19:47:00,054 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:01,362 INFO L93 Difference]: Finished difference Result 472 states and 532 transitions. [2021-12-14 19:47:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 19:47:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 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 27 [2021-12-14 19:47:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:01,364 INFO L225 Difference]: With dead ends: 472 [2021-12-14 19:47:01,364 INFO L226 Difference]: Without dead ends: 472 [2021-12-14 19:47:01,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=443, Invalid=2410, Unknown=9, NotChecked=0, Total=2862 [2021-12-14 19:47:01,365 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 1348 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 638 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:01,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1348 Valid, 1308 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1183 Invalid, 0 Unknown, 638 Unchecked, 0.6s Time] [2021-12-14 19:47:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-12-14 19:47:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 225. [2021-12-14 19:47:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 224 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2021-12-14 19:47:01,370 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 27 [2021-12-14 19:47:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:01,370 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2021-12-14 19:47:01,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2021-12-14 19:47:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:47:01,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:01,371 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:01,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:01,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 19:47:01,584 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 24884122, now seen corresponding path program 1 times [2021-12-14 19:47:01,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:01,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771188856] [2021-12-14 19:47:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:01,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:47:01,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:01,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771188856] [2021-12-14 19:47:01,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771188856] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:01,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:01,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:47:01,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182757256] [2021-12-14 19:47:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:01,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:01,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:01,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:01,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:01,620 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:01,625 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2021-12-14 19:47:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 29 [2021-12-14 19:47:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:01,627 INFO L225 Difference]: With dead ends: 227 [2021-12-14 19:47:01,627 INFO L226 Difference]: Without dead ends: 227 [2021-12-14 19:47:01,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:01,628 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:01,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:47:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-14 19:47:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-12-14 19:47:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 184 states have (on average 1.4565217391304348) internal successors, (268), 226 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 268 transitions. [2021-12-14 19:47:01,631 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 268 transitions. Word has length 29 [2021-12-14 19:47:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:01,632 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 268 transitions. [2021-12-14 19:47:01,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 268 transitions. [2021-12-14 19:47:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:47:01,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:01,635 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:01,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:47:01,635 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -197370768, now seen corresponding path program 1 times [2021-12-14 19:47:01,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:01,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276010177] [2021-12-14 19:47:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:01,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:01,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:01,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276010177] [2021-12-14 19:47:01,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276010177] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:47:01,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517667211] [2021-12-14 19:47:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:01,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:47:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:47:01,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:47:01,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:47:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:02,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-14 19:47:02,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:02,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:02,062 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:02,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:47:02,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:02,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:02,177 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:02,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:02,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:47:02,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-14 19:47:02,240 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:02,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2021-12-14 19:47:02,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:47:02,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-14 19:47:02,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:47:02,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:02,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:47:02,400 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:02,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2021-12-14 19:47:02,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:02,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:47:02,569 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 50 treesize of output 30 [2021-12-14 19:47:03,168 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:03,169 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 60 [2021-12-14 19:47:03,172 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:03,173 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2021-12-14 19:47:03,179 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:03,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 74 [2021-12-14 19:47:03,186 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:03,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 95 [2021-12-14 19:47:03,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 64 treesize of output 62 [2021-12-14 19:47:03,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 62 treesize of output 60 [2021-12-14 19:47:03,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 60 treesize of output 58 [2021-12-14 19:47:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:03,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517667211] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:47:03,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:47:03,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2021-12-14 19:47:03,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314943804] [2021-12-14 19:47:03,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:03,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 19:47:03,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 19:47:03,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=949, Unknown=3, NotChecked=0, Total=1056 [2021-12-14 19:47:03,519 INFO L87 Difference]: Start difference. First operand 227 states and 268 transitions. Second operand has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:04,762 INFO L93 Difference]: Finished difference Result 370 states and 414 transitions. [2021-12-14 19:47:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 19:47:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 33 states have internal predecessors, (78), 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 32 [2021-12-14 19:47:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:04,764 INFO L225 Difference]: With dead ends: 370 [2021-12-14 19:47:04,764 INFO L226 Difference]: Without dead ends: 370 [2021-12-14 19:47:04,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=431, Invalid=2322, Unknown=3, NotChecked=0, Total=2756 [2021-12-14 19:47:04,765 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 888 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:04,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 1143 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1112 Invalid, 0 Unknown, 726 Unchecked, 0.5s Time] [2021-12-14 19:47:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-14 19:47:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 228. [2021-12-14 19:47:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.454054054054054) internal successors, (269), 227 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 269 transitions. [2021-12-14 19:47:04,768 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 269 transitions. Word has length 32 [2021-12-14 19:47:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:04,768 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 269 transitions. [2021-12-14 19:47:04,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 269 transitions. [2021-12-14 19:47:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:47:04,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:04,769 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:04,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-14 19:47:04,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:47:04,969 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1640100151, now seen corresponding path program 1 times [2021-12-14 19:47:04,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:04,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754359783] [2021-12-14 19:47:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:04,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:47:05,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:05,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754359783] [2021-12-14 19:47:05,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754359783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:05,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:05,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:47:05,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295680031] [2021-12-14 19:47:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:05,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:47:05,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:47:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:47:05,022 INFO L87 Difference]: Start difference. First operand 228 states and 269 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:05,152 INFO L93 Difference]: Finished difference Result 246 states and 289 transitions. [2021-12-14 19:47:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:47:05,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 32 [2021-12-14 19:47:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:05,153 INFO L225 Difference]: With dead ends: 246 [2021-12-14 19:47:05,153 INFO L226 Difference]: Without dead ends: 246 [2021-12-14 19:47:05,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:47:05,154 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 49 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:05,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 532 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:47:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-14 19:47:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 237. [2021-12-14 19:47:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 194 states have (on average 1.4381443298969072) internal successors, (279), 236 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 279 transitions. [2021-12-14 19:47:05,157 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 279 transitions. Word has length 32 [2021-12-14 19:47:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:05,157 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 279 transitions. [2021-12-14 19:47:05,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2021-12-14 19:47:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:47:05,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:05,158 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:05,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:47:05,158 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159733, now seen corresponding path program 1 times [2021-12-14 19:47:05,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:05,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976500946] [2021-12-14 19:47:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:05,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:47:05,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:05,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976500946] [2021-12-14 19:47:05,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976500946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:05,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:05,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:47:05,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596195281] [2021-12-14 19:47:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:05,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:05,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:05,183 INFO L87 Difference]: Start difference. First operand 237 states and 279 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:05,230 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2021-12-14 19:47:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:05,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2021-12-14 19:47:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:05,231 INFO L225 Difference]: With dead ends: 234 [2021-12-14 19:47:05,231 INFO L226 Difference]: Without dead ends: 234 [2021-12-14 19:47:05,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:05,231 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 78 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:05,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:47:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-14 19:47:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-12-14 19:47:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.407216494845361) internal successors, (273), 233 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2021-12-14 19:47:05,234 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 32 [2021-12-14 19:47:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:05,235 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2021-12-14 19:47:05,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2021-12-14 19:47:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:47:05,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:05,235 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:05,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:47:05,236 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159732, now seen corresponding path program 1 times [2021-12-14 19:47:05,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:05,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348262403] [2021-12-14 19:47:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:05,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:47:05,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:05,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348262403] [2021-12-14 19:47:05,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348262403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:05,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:05,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:47:05,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701111335] [2021-12-14 19:47:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:05,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:05,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:05,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:05,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:05,256 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:05,287 INFO L93 Difference]: Finished difference Result 232 states and 267 transitions. [2021-12-14 19:47:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2021-12-14 19:47:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:05,288 INFO L225 Difference]: With dead ends: 232 [2021-12-14 19:47:05,288 INFO L226 Difference]: Without dead ends: 232 [2021-12-14 19:47:05,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:05,289 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:05,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 173 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:47:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-14 19:47:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2021-12-14 19:47:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 230 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2021-12-14 19:47:05,292 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 32 [2021-12-14 19:47:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:05,292 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2021-12-14 19:47:05,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2021-12-14 19:47:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:47:05,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:05,293 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:05,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:47:05,293 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662762, now seen corresponding path program 1 times [2021-12-14 19:47:05,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:05,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327961350] [2021-12-14 19:47:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:05,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:47:05,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:05,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327961350] [2021-12-14 19:47:05,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327961350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:05,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:05,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:47:05,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739610485] [2021-12-14 19:47:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:05,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:47:05,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:47:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:47:05,326 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:05,491 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2021-12-14 19:47:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:47:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 36 [2021-12-14 19:47:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:05,493 INFO L225 Difference]: With dead ends: 254 [2021-12-14 19:47:05,493 INFO L226 Difference]: Without dead ends: 254 [2021-12-14 19:47:05,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:47:05,493 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 113 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:05,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 334 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:47:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-14 19:47:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2021-12-14 19:47:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 237 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 279 transitions. [2021-12-14 19:47:05,496 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 279 transitions. Word has length 36 [2021-12-14 19:47:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:05,496 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 279 transitions. [2021-12-14 19:47:05,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 279 transitions. [2021-12-14 19:47:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:47:05,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:05,497 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:05,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:47:05,497 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662761, now seen corresponding path program 1 times [2021-12-14 19:47:05,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:05,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384689459] [2021-12-14 19:47:05,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:05,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:05,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:05,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384689459] [2021-12-14 19:47:05,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384689459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:47:05,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481708363] [2021-12-14 19:47:05,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:05,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:47:05,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:47:05,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:47:05,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:47:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:05,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:47:05,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:05,843 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 23 treesize of output 15 [2021-12-14 19:47:05,848 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 28 treesize of output 16 [2021-12-14 19:47:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:47:05,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:05,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481708363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:05,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:47:05,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2021-12-14 19:47:05,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728163726] [2021-12-14 19:47:05,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:05,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:47:05,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:47:05,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:47:05,887 INFO L87 Difference]: Start difference. First operand 238 states and 279 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:06,099 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2021-12-14 19:47:06,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:47:06,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 36 [2021-12-14 19:47:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:06,101 INFO L225 Difference]: With dead ends: 250 [2021-12-14 19:47:06,101 INFO L226 Difference]: Without dead ends: 250 [2021-12-14 19:47:06,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:47:06,101 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:06,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 407 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:47:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-12-14 19:47:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2021-12-14 19:47:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 201 states have (on average 1.36318407960199) internal successors, (274), 235 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2021-12-14 19:47:06,104 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 36 [2021-12-14 19:47:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:06,104 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2021-12-14 19:47:06,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2021-12-14 19:47:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:47:06,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:06,105 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:06,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 19:47:06,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 19:47:06,315 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1546801846, now seen corresponding path program 1 times [2021-12-14 19:47:06,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:06,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810020032] [2021-12-14 19:47:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:06,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:06,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:06,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810020032] [2021-12-14 19:47:06,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810020032] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:47:06,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393224324] [2021-12-14 19:47:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:06,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:47:06,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:47:06,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:47:06,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:47:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:06,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-14 19:47:06,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:06,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:06,777 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:06,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:47:06,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:06,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:06,876 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:06,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:06,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:47:06,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-14 19:47:06,937 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:06,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2021-12-14 19:47:06,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:47:06,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 19:47:07,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:47:07,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:07,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:47:07,262 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:07,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2021-12-14 19:47:07,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:07,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:47:07,464 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 77 treesize of output 57 [2021-12-14 19:47:08,038 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:08,038 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2021-12-14 19:47:08,042 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:08,042 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2021-12-14 19:47:08,048 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:08,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2021-12-14 19:47:08,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:08,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 95 [2021-12-14 19:47:08,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 64 treesize of output 62 [2021-12-14 19:47:08,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 62 treesize of output 60 [2021-12-14 19:47:08,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 60 treesize of output 58 [2021-12-14 19:47:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:08,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393224324] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:47:08,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:47:08,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2021-12-14 19:47:08,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857258033] [2021-12-14 19:47:08,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:08,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 19:47:08,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:08,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 19:47:08,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=946, Unknown=4, NotChecked=0, Total=1056 [2021-12-14 19:47:08,380 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:08,867 INFO L93 Difference]: Finished difference Result 263 states and 303 transitions. [2021-12-14 19:47:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:47:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 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 38 [2021-12-14 19:47:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:08,868 INFO L225 Difference]: With dead ends: 263 [2021-12-14 19:47:08,868 INFO L226 Difference]: Without dead ends: 263 [2021-12-14 19:47:08,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1464, Unknown=4, NotChecked=0, Total=1640 [2021-12-14 19:47:08,869 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 96 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:08,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 1380 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 516 Invalid, 0 Unknown, 406 Unchecked, 0.2s Time] [2021-12-14 19:47:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-14 19:47:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 244. [2021-12-14 19:47:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.3588516746411483) internal successors, (284), 243 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 284 transitions. [2021-12-14 19:47:08,872 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 284 transitions. Word has length 38 [2021-12-14 19:47:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:08,872 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 284 transitions. [2021-12-14 19:47:08,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 284 transitions. [2021-12-14 19:47:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:47:08,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:08,872 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:08,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:09,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 19:47:09,083 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:09,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -247701985, now seen corresponding path program 2 times [2021-12-14 19:47:09,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:47:09,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754127951] [2021-12-14 19:47:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:09,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:47:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:09,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:47:09,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754127951] [2021-12-14 19:47:09,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754127951] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:47:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758406092] [2021-12-14 19:47:09,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:47:09,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:47:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:47:09,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:47:09,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:47:09,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:47:09,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:47:09,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-14 19:47:09,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:09,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:09,476 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:09,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:47:09,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:09,619 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:09,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:09,660 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:09,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:09,682 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:09,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:47:09,716 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 19:47:09,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-14 19:47:09,852 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:47:09,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-12-14 19:47:09,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2021-12-14 19:47:09,950 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:47:09,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2021-12-14 19:47:09,956 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-14 19:47:09,956 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:47:09,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-12-14 19:47:09,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480392723] [2021-12-14 19:47:09,957 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:09,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 19:47:09,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:47:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 19:47:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:47:09,958 INFO L87 Difference]: Start difference. First operand 244 states and 284 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:47:09,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:47:09,959 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:09,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:47:09,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 19:47:10,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:47:10,190 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@168a60bf at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:47:10,195 INFO L158 Benchmark]: Toolchain (without parser) took 18410.29ms. Allocated memory was 96.5MB in the beginning and 268.4MB in the end (delta: 172.0MB). Free memory was 71.6MB in the beginning and 147.2MB in the end (delta: -75.6MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2021-12-14 19:47:10,195 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:47:10,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.68ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 71.6MB in the beginning and 93.6MB in the end (delta: -22.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:47:10,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.77ms. Allocated memory is still 125.8MB. Free memory was 93.6MB in the beginning and 91.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 19:47:10,196 INFO L158 Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 125.8MB. Free memory was 91.1MB in the beginning and 89.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:47:10,196 INFO L158 Benchmark]: RCFGBuilder took 445.38ms. Allocated memory is still 125.8MB. Free memory was 89.3MB in the beginning and 67.3MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-14 19:47:10,197 INFO L158 Benchmark]: TraceAbstraction took 17542.38ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 66.9MB in the beginning and 147.2MB in the end (delta: -80.3MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2021-12-14 19:47:10,200 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.16ms. Allocated memory is still 96.5MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.68ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 71.6MB in the beginning and 93.6MB in the end (delta: -22.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.77ms. Allocated memory is still 125.8MB. Free memory was 93.6MB in the beginning and 91.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.99ms. Allocated memory is still 125.8MB. Free memory was 91.1MB in the beginning and 89.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 445.38ms. Allocated memory is still 125.8MB. Free memory was 89.3MB in the beginning and 67.3MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17542.38ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 66.9MB in the beginning and 147.2MB in the end (delta: -80.3MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@168a60bf de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@168a60bf: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-14 19:47:10,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-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 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:47:12,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:47:12,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:47:12,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:47:12,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:47:12,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:47:12,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:47:12,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:47:12,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:47:12,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:47:12,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:47:12,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:47:12,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:47:12,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:47:12,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:47:12,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:47:12,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:47:12,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:47:12,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:47:12,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:47:12,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:47:12,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:47:12,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:47:12,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:47:12,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:47:12,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:47:12,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:47:12,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:47:12,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:47:12,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:47:12,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:47:12,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:47:12,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:47:12,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:47:12,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:47:12,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:47:12,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:47:12,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:47:12,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:47:12,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:47:12,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:47:12,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:47:12,159 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:47:12,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:47:12,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:47:12,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:47:12,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:47:12,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:47:12,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:47:12,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:47:12,162 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:47:12,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:47:12,163 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:47:12,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:47:12,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:47:12,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:47:12,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:47:12,164 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:47:12,164 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:47:12,164 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:47:12,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:47:12,165 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:47:12,165 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:47:12,165 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:47:12,165 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:47:12,165 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:47:12,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:47:12,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:47:12,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:47:12,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:47:12,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:47:12,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:47:12,166 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:47:12,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:47:12,167 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:47:12,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:47:12,167 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 -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2021-12-14 19:47:12,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:47:12,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:47:12,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:47:12,484 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:47:12,485 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:47:12,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-14 19:47:12,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e592ef7/88be36add9d649dd9f9f3759385a1ad8/FLAGcf0799fc6 [2021-12-14 19:47:12,863 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:47:12,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-14 19:47:12,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e592ef7/88be36add9d649dd9f9f3759385a1ad8/FLAGcf0799fc6 [2021-12-14 19:47:13,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e592ef7/88be36add9d649dd9f9f3759385a1ad8 [2021-12-14 19:47:13,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:47:13,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:47:13,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:47:13,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:47:13,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:47:13,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b75502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13, skipping insertion in model container [2021-12-14 19:47:13,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:47:13,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:47:13,580 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-sorted-2.i[22317,22330] [2021-12-14 19:47:13,585 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-sorted-2.i[22452,22465] [2021-12-14 19:47:13,588 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-sorted-2.i[22612,22625] [2021-12-14 19:47:13,593 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-sorted-2.i[22941,22954] [2021-12-14 19:47:13,595 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-sorted-2.i[23005,23018] [2021-12-14 19:47:13,597 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-sorted-2.i[23136,23149] [2021-12-14 19:47:13,598 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-sorted-2.i[23200,23213] [2021-12-14 19:47:13,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:47:13,625 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:47:13,656 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-sorted-2.i[22317,22330] [2021-12-14 19:47:13,657 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-sorted-2.i[22452,22465] [2021-12-14 19:47:13,658 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-sorted-2.i[22612,22625] [2021-12-14 19:47:13,660 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-sorted-2.i[22941,22954] [2021-12-14 19:47:13,661 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-sorted-2.i[23005,23018] [2021-12-14 19:47:13,661 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-sorted-2.i[23136,23149] [2021-12-14 19:47:13,662 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-sorted-2.i[23200,23213] [2021-12-14 19:47:13,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:47:13,684 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:47:13,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13 WrapperNode [2021-12-14 19:47:13,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:47:13,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:47:13,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:47:13,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:47:13,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,746 INFO L137 Inliner]: procedures = 122, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2021-12-14 19:47:13,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:47:13,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:47:13,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:47:13,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:47:13,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:47:13,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:47:13,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:47:13,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:47:13,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (1/1) ... [2021-12-14 19:47:13,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:47:13,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:47:13,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:47:13,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:47:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:47:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:47:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:47:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:47:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:47:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:47:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:47:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:47:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:47:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:47:13,986 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:47:13,987 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:47:14,386 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:47:14,391 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:47:14,391 INFO L301 CfgBuilder]: Removed 20 assume(true) statements. [2021-12-14 19:47:14,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:47:14 BoogieIcfgContainer [2021-12-14 19:47:14,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:47:14,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:47:14,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:47:14,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:47:14,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:47:13" (1/3) ... [2021-12-14 19:47:14,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b82f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:47:14, skipping insertion in model container [2021-12-14 19:47:14,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:13" (2/3) ... [2021-12-14 19:47:14,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b82f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:47:14, skipping insertion in model container [2021-12-14 19:47:14,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:47:14" (3/3) ... [2021-12-14 19:47:14,411 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2021-12-14 19:47:14,415 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:47:14,415 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-12-14 19:47:14,444 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:47:14,448 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:47:14,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-12-14 19:47:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 90 states have (on average 2.2111111111111112) internal successors, (199), 161 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:47:14,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:14,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:47:14,465 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:47:14,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:14,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438087236] [2021-12-14 19:47:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:14,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:14,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:14,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 19:47:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:14,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:47:14,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:14,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:14,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:14,611 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438087236] [2021-12-14 19:47:14,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438087236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:14,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:14,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:47:14,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989387692] [2021-12-14 19:47:14,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:14,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:14,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:14,636 INFO L87 Difference]: Start difference. First operand has 162 states, 90 states have (on average 2.2111111111111112) internal successors, (199), 161 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:14,871 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2021-12-14 19:47:14,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:14,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-14 19:47:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:14,879 INFO L225 Difference]: With dead ends: 166 [2021-12-14 19:47:14,879 INFO L226 Difference]: Without dead ends: 162 [2021-12-14 19:47:14,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:14,882 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:14,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:47:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-14 19:47:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-12-14 19:47:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 89 states have (on average 1.8876404494382022) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2021-12-14 19:47:14,908 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 3 [2021-12-14 19:47:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:14,908 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2021-12-14 19:47:14,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2021-12-14 19:47:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:47:14,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:14,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:47:14,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:15,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:15,118 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:15,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:15,119 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:47:15,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:15,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199007814] [2021-12-14 19:47:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:15,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:15,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 19:47:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:15,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:47:15,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:15,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:15,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:15,202 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199007814] [2021-12-14 19:47:15,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199007814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:15,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:15,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:47:15,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341161509] [2021-12-14 19:47:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:15,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:15,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:15,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:15,206 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:15,375 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2021-12-14 19:47:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:15,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-14 19:47:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:15,377 INFO L225 Difference]: With dead ends: 160 [2021-12-14 19:47:15,377 INFO L226 Difference]: Without dead ends: 160 [2021-12-14 19:47:15,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:15,378 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 151 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:15,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 109 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:47:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-14 19:47:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2021-12-14 19:47:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 155 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2021-12-14 19:47:15,385 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 3 [2021-12-14 19:47:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:15,385 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2021-12-14 19:47:15,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2021-12-14 19:47:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:47:15,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:15,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:15,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:15,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:15,593 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-14 19:47:15,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:15,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967508054] [2021-12-14 19:47:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:15,595 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:15,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:15,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:15,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 19:47:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:15,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:47:15,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:15,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:15,708 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:47:15,708 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 17 treesize of output 22 [2021-12-14 19:47:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:15,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:15,724 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:15,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967508054] [2021-12-14 19:47:15,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967508054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:15,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:15,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:47:15,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567964453] [2021-12-14 19:47:15,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:15,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:47:15,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:47:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:47:15,726 INFO L87 Difference]: Start difference. First operand 156 states and 166 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-14 19:47:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:15,986 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2021-12-14 19:47:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:47:15,987 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-14 19:47:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:15,988 INFO L225 Difference]: With dead ends: 164 [2021-12-14 19:47:15,988 INFO L226 Difference]: Without dead ends: 164 [2021-12-14 19:47:15,988 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-14 19:47:15,989 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 267 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:15,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 83 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:47:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-14 19:47:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 153. [2021-12-14 19:47:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 103 states have (on average 1.6893203883495145) internal successors, (174), 152 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2021-12-14 19:47:15,995 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 7 [2021-12-14 19:47:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:15,995 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2021-12-14 19:47:15,995 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-14 19:47:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2021-12-14 19:47:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:47:15,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:15,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:16,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:16,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:16,196 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-14 19:47:16,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:16,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125097063] [2021-12-14 19:47:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:16,197 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:16,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:16,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 19:47:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:16,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:47:16,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:16,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:16,354 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:16,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:47:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:16,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:16,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:16,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125097063] [2021-12-14 19:47:16,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125097063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:16,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:16,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:47:16,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56348751] [2021-12-14 19:47:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:16,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:47:16,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:47:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:47:16,369 INFO L87 Difference]: Start difference. First operand 153 states and 174 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-14 19:47:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:16,720 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2021-12-14 19:47:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:47:16,720 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-14 19:47:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:16,721 INFO L225 Difference]: With dead ends: 233 [2021-12-14 19:47:16,721 INFO L226 Difference]: Without dead ends: 233 [2021-12-14 19:47:16,722 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-14 19:47:16,722 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 303 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:16,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 136 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:47:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-14 19:47:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 199. [2021-12-14 19:47:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 198 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2021-12-14 19:47:16,734 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 7 [2021-12-14 19:47:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:16,734 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2021-12-14 19:47:16,734 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-14 19:47:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2021-12-14 19:47:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:47:16,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:16,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:16,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:16,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:16,941 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:16,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1837264999, now seen corresponding path program 1 times [2021-12-14 19:47:16,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:16,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852660082] [2021-12-14 19:47:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:16,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:16,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:16,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:16,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 19:47:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:17,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:47:17,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:17,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:17,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:17,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852660082] [2021-12-14 19:47:17,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852660082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:17,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:17,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:47:17,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60324867] [2021-12-14 19:47:17,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:17,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:17,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:17,056 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:17,071 INFO L93 Difference]: Finished difference Result 237 states and 277 transitions. [2021-12-14 19:47:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:17,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:47:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:17,073 INFO L225 Difference]: With dead ends: 237 [2021-12-14 19:47:17,073 INFO L226 Difference]: Without dead ends: 237 [2021-12-14 19:47:17,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:17,076 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 107 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:17,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 210 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:47:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-14 19:47:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 207. [2021-12-14 19:47:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 157 states have (on average 1.5796178343949046) internal successors, (248), 206 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2021-12-14 19:47:17,100 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 9 [2021-12-14 19:47:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:17,101 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2021-12-14 19:47:17,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2021-12-14 19:47:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:47:17,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:17,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:17,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:17,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:17,309 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-14 19:47:17,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:17,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231879236] [2021-12-14 19:47:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:17,312 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:17,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:17,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 19:47:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:17,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:47:17,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:17,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:17,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:17,420 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-14 19:47:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:17,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:17,435 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231879236] [2021-12-14 19:47:17,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231879236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:17,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:17,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:47:17,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963333615] [2021-12-14 19:47:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:17,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:47:17,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:47:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:47:17,437 INFO L87 Difference]: Start difference. First operand 207 states and 248 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-14 19:47:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:17,977 INFO L93 Difference]: Finished difference Result 213 states and 253 transitions. [2021-12-14 19:47:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:47:17,978 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-14 19:47:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:17,979 INFO L225 Difference]: With dead ends: 213 [2021-12-14 19:47:17,979 INFO L226 Difference]: Without dead ends: 213 [2021-12-14 19:47:17,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:47:17,980 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:17,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 347 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:47:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-14 19:47:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2021-12-14 19:47:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.5668789808917198) internal successors, (246), 205 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2021-12-14 19:47:17,987 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 11 [2021-12-14 19:47:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:17,988 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2021-12-14 19:47:17,988 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-14 19:47:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2021-12-14 19:47:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:47:17,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:17,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:18,011 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-14 19:47:18,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:18,189 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-14 19:47:18,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:18,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786541440] [2021-12-14 19:47:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:18,190 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:18,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:18,194 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:18,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 19:47:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:18,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:47:18,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:18,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:18,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:18,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:18,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-14 19:47:18,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:18,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:18,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:18,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786541440] [2021-12-14 19:47:18,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786541440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:18,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:18,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:47:18,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094691533] [2021-12-14 19:47:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:18,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:47:18,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:47:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:47:18,362 INFO L87 Difference]: Start difference. First operand 206 states and 246 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-14 19:47:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:18,795 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-12-14 19:47:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:47:18,795 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-14 19:47:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:18,796 INFO L225 Difference]: With dead ends: 202 [2021-12-14 19:47:18,796 INFO L226 Difference]: Without dead ends: 202 [2021-12-14 19:47:18,796 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-14 19:47:18,797 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 13 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:18,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 428 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:47:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-14 19:47:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2021-12-14 19:47:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 196 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 234 transitions. [2021-12-14 19:47:18,801 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 234 transitions. Word has length 11 [2021-12-14 19:47:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:18,801 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 234 transitions. [2021-12-14 19:47:18,801 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-14 19:47:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 234 transitions. [2021-12-14 19:47:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:47:18,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:18,801 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-14 19:47:18,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:19,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:19,011 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 415940479, now seen corresponding path program 1 times [2021-12-14 19:47:19,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:19,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051087384] [2021-12-14 19:47:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:19,013 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:19,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:19,014 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:19,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 19:47:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:19,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:47:19,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:47:19,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:19,122 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:19,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051087384] [2021-12-14 19:47:19,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051087384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:19,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:19,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:47:19,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569569534] [2021-12-14 19:47:19,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:19,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:47:19,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:19,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:47:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:47:19,123 INFO L87 Difference]: Start difference. First operand 197 states and 234 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-14 19:47:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:19,408 INFO L93 Difference]: Finished difference Result 228 states and 249 transitions. [2021-12-14 19:47:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:47:19,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-14 19:47:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:19,414 INFO L225 Difference]: With dead ends: 228 [2021-12-14 19:47:19,414 INFO L226 Difference]: Without dead ends: 228 [2021-12-14 19:47:19,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:47:19,415 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 273 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:19,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 186 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:47:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-14 19:47:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 195. [2021-12-14 19:47:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.513157894736842) internal successors, (230), 194 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 230 transitions. [2021-12-14 19:47:19,419 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 230 transitions. Word has length 18 [2021-12-14 19:47:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:19,419 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 230 transitions. [2021-12-14 19:47:19,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-14 19:47:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 230 transitions. [2021-12-14 19:47:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:47:19,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:19,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:19,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-14 19:47:19,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:19,630 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1799357454, now seen corresponding path program 1 times [2021-12-14 19:47:19,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:19,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131839792] [2021-12-14 19:47:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:19,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:19,633 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:19,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 19:47:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:19,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:47:19,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:19,737 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:47:19,738 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 21 [2021-12-14 19:47:19,848 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-14 19:47:19,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 51 [2021-12-14 19:47:19,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:20,231 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:20,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 51 [2021-12-14 19:47:20,394 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:20,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2021-12-14 19:47:20,821 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 46 treesize of output 30 [2021-12-14 19:47:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:20,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:47:21,364 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:21,364 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-14 19:47:21,374 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:21,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 59 [2021-12-14 19:47:21,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 20 [2021-12-14 19:47:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:33,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:33,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131839792] [2021-12-14 19:47:33,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131839792] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:47:33,240 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:47:33,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2021-12-14 19:47:33,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684161419] [2021-12-14 19:47:33,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:33,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-14 19:47:33,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:33,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 19:47:33,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=343, Unknown=12, NotChecked=0, Total=420 [2021-12-14 19:47:33,245 INFO L87 Difference]: Start difference. First operand 195 states and 230 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:33,588 INFO L93 Difference]: Finished difference Result 219 states and 260 transitions. [2021-12-14 19:47:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:47:33,588 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 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 24 [2021-12-14 19:47:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:33,589 INFO L225 Difference]: With dead ends: 219 [2021-12-14 19:47:33,589 INFO L226 Difference]: Without dead ends: 219 [2021-12-14 19:47:33,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=89, Invalid=451, Unknown=12, NotChecked=0, Total=552 [2021-12-14 19:47:33,590 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 26 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:33,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 980 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 512 Unchecked, 0.2s Time] [2021-12-14 19:47:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-14 19:47:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2021-12-14 19:47:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.4853801169590644) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2021-12-14 19:47:33,593 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 24 [2021-12-14 19:47:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:33,594 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2021-12-14 19:47:33,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2021-12-14 19:47:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:47:33,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:33,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:33,607 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-14 19:47:33,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:33,805 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1799357455, now seen corresponding path program 1 times [2021-12-14 19:47:33,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:33,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750027863] [2021-12-14 19:47:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:33,806 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:33,807 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:33,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 19:47:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:33,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 19:47:33,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:33,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:33,993 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:33,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 19:47:34,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:34,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:34,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:34,159 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:47:34,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 19:47:34,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-14 19:47:34,180 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:34,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:47:34,247 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:34,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:47:34,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:47:34,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:47:34,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:34,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:47:34,828 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-14 19:47:34,925 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-14 19:47:34,955 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_225) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-14 19:47:34,979 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:34,979 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-14 19:47:35,003 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:35,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-14 19:47:35,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2021-12-14 19:47:35,053 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:35,053 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-14 19:47:35,063 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:35,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-14 19:47:35,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:47:35,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 19:47:35,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:47:35,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 19:47:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:35,220 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:35,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750027863] [2021-12-14 19:47:35,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750027863] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:47:35,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:47:35,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-12-14 19:47:35,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395177137] [2021-12-14 19:47:35,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:35,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:47:35,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:35,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:47:35,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=227, Unknown=3, NotChecked=96, Total=380 [2021-12-14 19:47:35,221 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:37,943 INFO L93 Difference]: Finished difference Result 402 states and 461 transitions. [2021-12-14 19:47:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:47:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 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 24 [2021-12-14 19:47:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:37,945 INFO L225 Difference]: With dead ends: 402 [2021-12-14 19:47:37,945 INFO L226 Difference]: Without dead ends: 402 [2021-12-14 19:47:37,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=136, Invalid=425, Unknown=3, NotChecked=138, Total=702 [2021-12-14 19:47:37,946 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 515 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:37,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 922 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 906 Invalid, 0 Unknown, 755 Unchecked, 1.7s Time] [2021-12-14 19:47:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-12-14 19:47:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 214. [2021-12-14 19:47:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.4795321637426901) internal successors, (253), 213 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2021-12-14 19:47:37,964 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 24 [2021-12-14 19:47:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:37,964 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2021-12-14 19:47:37,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2021-12-14 19:47:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:47:37,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:37,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:37,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:38,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:38,166 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1680561416, now seen corresponding path program 1 times [2021-12-14 19:47:38,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:38,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509558500] [2021-12-14 19:47:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:38,168 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:38,169 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:38,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 19:47:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:38,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:47:38,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:47:38,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:38,330 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:38,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509558500] [2021-12-14 19:47:38,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509558500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:38,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:38,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:47:38,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134087364] [2021-12-14 19:47:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:38,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:38,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:38,332 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:38,340 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2021-12-14 19:47:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:38,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2021-12-14 19:47:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:38,341 INFO L225 Difference]: With dead ends: 216 [2021-12-14 19:47:38,341 INFO L226 Difference]: Without dead ends: 216 [2021-12-14 19:47:38,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:38,342 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:38,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:47:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-14 19:47:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-12-14 19:47:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 173 states have (on average 1.4739884393063585) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2021-12-14 19:47:38,363 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 255 transitions. Word has length 26 [2021-12-14 19:47:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:38,365 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 255 transitions. [2021-12-14 19:47:38,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions. [2021-12-14 19:47:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:47:38,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:38,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:38,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:38,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:38,576 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -558780366, now seen corresponding path program 1 times [2021-12-14 19:47:38,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:38,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103594693] [2021-12-14 19:47:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:38,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:38,578 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:38,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 19:47:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:38,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:47:38,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:38,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:47:38,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:38,709 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:38,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103594693] [2021-12-14 19:47:38,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103594693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:38,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:38,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:47:38,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939928773] [2021-12-14 19:47:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:38,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:38,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:38,711 INFO L87 Difference]: Start difference. First operand 216 states and 255 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:38,827 INFO L93 Difference]: Finished difference Result 214 states and 249 transitions. [2021-12-14 19:47:38,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:38,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-12-14 19:47:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:38,829 INFO L225 Difference]: With dead ends: 214 [2021-12-14 19:47:38,829 INFO L226 Difference]: Without dead ends: 214 [2021-12-14 19:47:38,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:38,829 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 70 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:38,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 163 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:47:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-14 19:47:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2021-12-14 19:47:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 173 states have (on average 1.439306358381503) internal successors, (249), 212 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2021-12-14 19:47:38,833 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 27 [2021-12-14 19:47:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:38,833 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2021-12-14 19:47:38,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2021-12-14 19:47:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:47:38,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:38,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:38,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:39,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:39,052 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash -558780365, now seen corresponding path program 1 times [2021-12-14 19:47:39,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:39,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108391817] [2021-12-14 19:47:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:39,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:39,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:39,054 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:39,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-14 19:47:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:39,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:47:39,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:39,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:47:39,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:39,162 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:39,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108391817] [2021-12-14 19:47:39,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108391817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:39,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:39,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:47:39,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330303027] [2021-12-14 19:47:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:39,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:47:39,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:39,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:47:39,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:39,164 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:39,309 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2021-12-14 19:47:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:47:39,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-12-14 19:47:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:39,310 INFO L225 Difference]: With dead ends: 210 [2021-12-14 19:47:39,310 INFO L226 Difference]: Without dead ends: 210 [2021-12-14 19:47:39,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:47:39,311 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 75 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:39,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 141 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:47:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-14 19:47:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-12-14 19:47:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 209 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 243 transitions. [2021-12-14 19:47:39,314 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 243 transitions. Word has length 27 [2021-12-14 19:47:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:39,314 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 243 transitions. [2021-12-14 19:47:39,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 243 transitions. [2021-12-14 19:47:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:47:39,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:39,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:39,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:39,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:39,524 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash -142290181, now seen corresponding path program 1 times [2021-12-14 19:47:39,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:39,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596626987] [2021-12-14 19:47:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:39,526 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:39,527 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:39,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-14 19:47:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:39,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:47:39,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:39,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:39,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:47:39,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:39,742 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:39,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596626987] [2021-12-14 19:47:39,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596626987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:39,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:39,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:47:39,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857159961] [2021-12-14 19:47:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:39,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:47:39,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:47:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:47:39,743 INFO L87 Difference]: Start difference. First operand 210 states and 243 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:40,146 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2021-12-14 19:47:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:47:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2021-12-14 19:47:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:40,148 INFO L225 Difference]: With dead ends: 219 [2021-12-14 19:47:40,148 INFO L226 Difference]: Without dead ends: 219 [2021-12-14 19:47:40,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:47:40,148 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 25 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:40,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 414 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:47:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-14 19:47:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2021-12-14 19:47:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 213 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 248 transitions. [2021-12-14 19:47:40,152 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 248 transitions. Word has length 28 [2021-12-14 19:47:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:40,152 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 248 transitions. [2021-12-14 19:47:40,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 248 transitions. [2021-12-14 19:47:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:47:40,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:40,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:40,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:40,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:40,361 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1957250928, now seen corresponding path program 1 times [2021-12-14 19:47:40,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:40,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671672577] [2021-12-14 19:47:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:40,362 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:40,364 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:40,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-14 19:47:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:40,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:47:40,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:40,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:40,526 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:40,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 19:47:40,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:40,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:40,662 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:47:40,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2021-12-14 19:47:40,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2021-12-14 19:47:40,688 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:40,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:40,744 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:40,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2021-12-14 19:47:40,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 19:47:40,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-14 19:47:40,886 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 33 treesize of output 21 [2021-12-14 19:47:40,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 19:47:40,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:40,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:47:41,082 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 50 treesize of output 30 [2021-12-14 19:47:41,090 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|))) is different from false [2021-12-14 19:47:41,118 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_411) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|))) is different from false [2021-12-14 19:47:41,128 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_411) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:47:41,144 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:41,144 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:47:41,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:41,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-14 19:47:41,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2021-12-14 19:47:41,182 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:47:41,183 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2021-12-14 19:47:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:41,307 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:41,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671672577] [2021-12-14 19:47:41,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671672577] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:47:41,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:47:41,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-14 19:47:41,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510252319] [2021-12-14 19:47:41,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:41,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 19:47:41,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 19:47:41,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2021-12-14 19:47:41,309 INFO L87 Difference]: Start difference. First operand 214 states and 248 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:42,676 INFO L93 Difference]: Finished difference Result 252 states and 288 transitions. [2021-12-14 19:47:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:47:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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 29 [2021-12-14 19:47:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:42,677 INFO L225 Difference]: With dead ends: 252 [2021-12-14 19:47:42,677 INFO L226 Difference]: Without dead ends: 252 [2021-12-14 19:47:42,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=643, Unknown=3, NotChecked=162, Total=930 [2021-12-14 19:47:42,678 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 121 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:42,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 1284 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 642 Invalid, 0 Unknown, 409 Unchecked, 0.9s Time] [2021-12-14 19:47:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-14 19:47:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 216. [2021-12-14 19:47:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 179 states have (on average 1.3966480446927374) internal successors, (250), 215 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2021-12-14 19:47:42,681 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 29 [2021-12-14 19:47:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:42,682 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2021-12-14 19:47:42,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2021-12-14 19:47:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:47:42,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:42,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:42,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:42,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:42,890 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 247061139, now seen corresponding path program 1 times [2021-12-14 19:47:42,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:42,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980276916] [2021-12-14 19:47:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:42,892 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:42,899 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:42,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-14 19:47:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:42,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:47:42,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:43,054 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 26 treesize of output 18 [2021-12-14 19:47:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:47:43,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:43,068 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980276916] [2021-12-14 19:47:43,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980276916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:43,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:43,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:47:43,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171307172] [2021-12-14 19:47:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:43,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:47:43,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:47:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:47:43,070 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:43,502 INFO L93 Difference]: Finished difference Result 235 states and 269 transitions. [2021-12-14 19:47:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:47:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2021-12-14 19:47:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:43,503 INFO L225 Difference]: With dead ends: 235 [2021-12-14 19:47:43,503 INFO L226 Difference]: Without dead ends: 235 [2021-12-14 19:47:43,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:47:43,504 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 106 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:43,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 303 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:47:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-14 19:47:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 221. [2021-12-14 19:47:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 220 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 259 transitions. [2021-12-14 19:47:43,508 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 259 transitions. Word has length 31 [2021-12-14 19:47:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:43,508 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 259 transitions. [2021-12-14 19:47:43,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 259 transitions. [2021-12-14 19:47:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:47:43,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:43,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:43,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:43,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:43,717 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:43,717 INFO L85 PathProgramCache]: Analyzing trace with hash 247061140, now seen corresponding path program 1 times [2021-12-14 19:47:43,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051773760] [2021-12-14 19:47:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:43,718 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:43,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:43,719 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-14 19:47:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:43,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:47:43,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:43,912 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 23 treesize of output 15 [2021-12-14 19:47:43,914 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 34 treesize of output 18 [2021-12-14 19:47:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:47:43,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:47:43,981 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:43,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051773760] [2021-12-14 19:47:43,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051773760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:47:43,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:43,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:47:43,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388218108] [2021-12-14 19:47:43,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:47:43,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:47:43,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:43,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:47:43,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:47:43,983 INFO L87 Difference]: Start difference. First operand 221 states and 259 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:45,001 INFO L93 Difference]: Finished difference Result 230 states and 263 transitions. [2021-12-14 19:47:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:47:45,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2021-12-14 19:47:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:45,003 INFO L225 Difference]: With dead ends: 230 [2021-12-14 19:47:45,003 INFO L226 Difference]: Without dead ends: 230 [2021-12-14 19:47:45,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:47:45,004 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 64 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:45,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 359 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 19:47:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-14 19:47:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 219. [2021-12-14 19:47:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 218 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2021-12-14 19:47:45,009 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 31 [2021-12-14 19:47:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:45,010 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2021-12-14 19:47:45,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2021-12-14 19:47:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:47:45,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:45,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:45,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:45,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:45,220 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1202557075, now seen corresponding path program 1 times [2021-12-14 19:47:45,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:45,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242341744] [2021-12-14 19:47:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:47:45,222 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:45,223 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:45,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-14 19:47:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:47:45,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-14 19:47:45,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:45,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:47:45,410 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:45,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 19:47:45,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:45,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:45,548 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:47:45,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2021-12-14 19:47:45,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2021-12-14 19:47:45,577 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:45,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:45,635 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:45,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2021-12-14 19:47:45,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2021-12-14 19:47:45,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 19:47:45,831 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 33 treesize of output 21 [2021-12-14 19:47:45,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 19:47:45,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:47:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:45,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:47:46,210 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 77 treesize of output 57 [2021-12-14 19:47:46,219 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:47:46,250 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|))) is different from false [2021-12-14 19:47:46,263 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_525) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0))) (forall ((v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2021-12-14 19:47:46,279 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:46,280 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:47:46,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:47:46,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-14 19:47:46,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2021-12-14 19:47:46,320 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:47:46,321 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2021-12-14 19:47:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:47:46,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:46,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242341744] [2021-12-14 19:47:46,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242341744] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:47:46,437 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:47:46,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-14 19:47:46,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094275308] [2021-12-14 19:47:46,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:47:46,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 19:47:46,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:47:46,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 19:47:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2021-12-14 19:47:46,438 INFO L87 Difference]: Start difference. First operand 219 states and 254 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:47:48,234 INFO L93 Difference]: Finished difference Result 267 states and 305 transitions. [2021-12-14 19:47:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:47:48,234 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 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 33 [2021-12-14 19:47:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:47:48,235 INFO L225 Difference]: With dead ends: 267 [2021-12-14 19:47:48,235 INFO L226 Difference]: Without dead ends: 267 [2021-12-14 19:47:48,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=610, Unknown=3, NotChecked=156, Total=870 [2021-12-14 19:47:48,236 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 95 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:47:48,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1516 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 857 Invalid, 0 Unknown, 441 Unchecked, 1.3s Time] [2021-12-14 19:47:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-12-14 19:47:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 225. [2021-12-14 19:47:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.3736842105263158) internal successors, (261), 224 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 261 transitions. [2021-12-14 19:47:48,240 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 261 transitions. Word has length 33 [2021-12-14 19:47:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:47:48,240 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 261 transitions. [2021-12-14 19:47:48,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:47:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 261 transitions. [2021-12-14 19:47:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:47:48,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:47:48,241 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:48,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:48,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:47:48,463 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-14 19:47:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:47:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash -266558986, now seen corresponding path program 2 times [2021-12-14 19:47:48,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:47:48,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91104988] [2021-12-14 19:47:48,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:47:48,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:47:48,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:47:48,465 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:47:48,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-14 19:47:48,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:47:48,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:47:48,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:47:48,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:47:48,665 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:47:48,665 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 21 [2021-12-14 19:47:48,741 INFO L354 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2021-12-14 19:47:48,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 34 [2021-12-14 19:47:48,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:47:48,858 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:48,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:48,888 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:47:48,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:48,904 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:47:48,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:47:48,945 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 19:47:48,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-14 19:47:49,078 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:47:49,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 54 [2021-12-14 19:47:49,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2021-12-14 19:47:49,205 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:47:49,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 61 [2021-12-14 19:47:49,208 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:47:49,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91104988] [2021-12-14 19:47:49,209 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-14 19:47:49,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1686306722] [2021-12-14 19:47:49,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:47:49,209 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:47:49,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:47:49,211 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:47:49,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-12-14 19:47:49,330 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5393d276 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:47:49,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871695405] [2021-12-14 19:47:49,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:47:49,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:47:49,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:47:49,333 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:47:49,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-14 19:47:49,381 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5393d276 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:47:49,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:47:49,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-14 19:47:49,382 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-14 19:47:49,382 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-14 19:47:49,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (70 of 71 remaining) [2021-12-14 19:47:49,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (69 of 71 remaining) [2021-12-14 19:47:49,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (68 of 71 remaining) [2021-12-14 19:47:49,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (67 of 71 remaining) [2021-12-14 19:47:49,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (66 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (65 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (64 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (63 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (62 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (61 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (60 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (59 of 71 remaining) [2021-12-14 19:47:49,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (58 of 71 remaining) [2021-12-14 19:47:49,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (57 of 71 remaining) [2021-12-14 19:47:49,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (56 of 71 remaining) [2021-12-14 19:47:49,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 71 remaining) [2021-12-14 19:47:49,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (54 of 71 remaining) [2021-12-14 19:47:49,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (53 of 71 remaining) [2021-12-14 19:47:49,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (52 of 71 remaining) [2021-12-14 19:47:49,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (51 of 71 remaining) [2021-12-14 19:47:49,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (50 of 71 remaining) [2021-12-14 19:47:49,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (49 of 71 remaining) [2021-12-14 19:47:49,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (48 of 71 remaining) [2021-12-14 19:47:49,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (47 of 71 remaining) [2021-12-14 19:47:49,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (46 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (45 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (44 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (43 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (42 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (41 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (40 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (39 of 71 remaining) [2021-12-14 19:47:49,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (38 of 71 remaining) [2021-12-14 19:47:49,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (37 of 71 remaining) [2021-12-14 19:47:49,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (36 of 71 remaining) [2021-12-14 19:47:49,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (35 of 71 remaining) [2021-12-14 19:47:49,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (34 of 71 remaining) [2021-12-14 19:47:49,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (33 of 71 remaining) [2021-12-14 19:47:49,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (32 of 71 remaining) [2021-12-14 19:47:49,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (31 of 71 remaining) [2021-12-14 19:47:49,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (30 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (29 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (28 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (27 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (26 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (25 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (24 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (23 of 71 remaining) [2021-12-14 19:47:49,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (22 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (21 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (20 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (19 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (18 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (17 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (16 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (15 of 71 remaining) [2021-12-14 19:47:49,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (14 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (13 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (12 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (11 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (10 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK (9 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK (8 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION (7 of 71 remaining) [2021-12-14 19:47:49,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION (6 of 71 remaining) [2021-12-14 19:47:49,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION (5 of 71 remaining) [2021-12-14 19:47:49,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (4 of 71 remaining) [2021-12-14 19:47:49,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE (3 of 71 remaining) [2021-12-14 19:47:49,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (2 of 71 remaining) [2021-12-14 19:47:49,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (1 of 71 remaining) [2021-12-14 19:47:49,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK (0 of 71 remaining) [2021-12-14 19:47:49,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:49,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:49,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2021-12-14 19:47:50,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-14 19:47:50,008 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:47:50,010 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:47:50,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:47:50 BoogieIcfgContainer [2021-12-14 19:47:50,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:47:50,033 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:47:50,033 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:47:50,033 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:47:50,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:47:14" (3/4) ... [2021-12-14 19:47:50,035 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:47:50,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:47:50,036 INFO L158 Benchmark]: Toolchain (without parser) took 36750.58ms. Allocated memory was 56.6MB in the beginning and 86.0MB in the end (delta: 29.4MB). Free memory was 34.6MB in the beginning and 41.7MB in the end (delta: -7.1MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2021-12-14 19:47:50,036 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.9MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:47:50,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.97ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 31.8MB in the end (delta: 2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 19:47:50,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.37ms. Allocated memory is still 56.6MB. Free memory was 31.8MB in the beginning and 29.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:47:50,037 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 56.6MB. Free memory was 29.5MB in the beginning and 27.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:47:50,037 INFO L158 Benchmark]: RCFGBuilder took 605.82ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 27.3MB in the beginning and 32.9MB in the end (delta: -5.6MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2021-12-14 19:47:50,037 INFO L158 Benchmark]: TraceAbstraction took 35630.97ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 52.1MB in the beginning and 41.7MB in the end (delta: 10.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2021-12-14 19:47:50,037 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 86.0MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:47:50,038 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.09ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.9MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.97ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 31.8MB in the end (delta: 2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.37ms. Allocated memory is still 56.6MB. Free memory was 31.8MB in the beginning and 29.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 56.6MB. Free memory was 29.5MB in the beginning and 27.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 605.82ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 27.3MB in the beginning and 32.9MB in the end (delta: -5.6MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35630.97ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 52.1MB in the beginning and 41.7MB in the end (delta: 10.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 86.0MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int marked = 0; [L1004] COND TRUE __VERIFIER_nondet_int() || !marked [L1007] x->next = malloc(sizeof(SLL)) [L1008] EXPR x->next [L1008] x = x->next [L1009] x->next = ((void*)0) [L1011] COND TRUE __VERIFIER_nondet_int() [L1013] marked = 1 [L1016] COND TRUE \read(marked) [L1017] x->data = 1 [L1004] COND TRUE __VERIFIER_nondet_int() || !marked [L1007] x->next = malloc(sizeof(SLL)) [L1008] EXPR x->next [L1008] x = x->next [L1009] x->next = ((void*)0) [L1011] COND TRUE __VERIFIER_nondet_int() [L1013] marked = 1 [L1016] COND TRUE \read(marked) [L1017] x->data = 1 [L1004] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1022] x = head [L1024] COND FALSE !(!(((void*)0) != x)) [L1025] marked = 0 [L1027] EXPR x->next [L1027] x->next != ((void*)0) && x->next->data == 0 [L1027] EXPR x->next [L1027] x->next->data - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: 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: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: 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: 1043]: 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: 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: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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, 162 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2467 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2467 mSDsluCounter, 7966 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2117 IncrementalHoareTripleChecker+Unchecked, 5959 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4666 IncrementalHoareTripleChecker+Invalid, 7002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 2007 mSDtfsCounter, 4666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 311 SyntacticMatches, 22 SemanticMatches, 159 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=18, InterpolantAutomatonStates: 134, 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, 18 MinimizatonAttempts, 430 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 437 ConstructedInterpolants, 54 QuantifiedInterpolants, 6585 SizeOfPredicates, 95 NumberOfNonLiveVariables, 2153 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 7/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-14 19:47:50,082 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