./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:12:26,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:12:26,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:12:26,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:12:26,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:12:26,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:12:26,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:12:26,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:12:26,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:12:26,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:12:26,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:12:26,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:12:26,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:12:26,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:12:26,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:12:26,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:12:26,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:12:26,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:12:26,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:12:26,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:12:26,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:12:26,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:12:26,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:12:26,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:12:26,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:12:26,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:12:26,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:12:26,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:12:26,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:12:26,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:12:26,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:12:26,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:12:26,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:12:26,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:12:26,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:12:26,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:12:26,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:12:26,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:12:26,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:12:26,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:12:26,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:12:26,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:12:26,192 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:12:26,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:12:26,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:12:26,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:12:26,194 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:12:26,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:12:26,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:12:26,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:12:26,196 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:12:26,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:12:26,196 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:12:26,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:12:26,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:12:26,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:12:26,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:12:26,197 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:12:26,198 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:12:26,198 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:12:26,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:12:26,198 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:12:26,199 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:12:26,199 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:12:26,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:12:26,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:12:26,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:12:26,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:26,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:12:26,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:12:26,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:12:26,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:12:26,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:12:26,202 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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2021-12-22 00:12:26,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:12:26,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:12:26,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:12:26,456 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:12:26,456 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:12:26,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2021-12-22 00:12:26,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b0eb5be/8026d3019cbb43cca9c82e219f2129d6/FLAG8e14a383b [2021-12-22 00:12:26,927 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:12:26,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2021-12-22 00:12:26,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b0eb5be/8026d3019cbb43cca9c82e219f2129d6/FLAG8e14a383b [2021-12-22 00:12:26,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b0eb5be/8026d3019cbb43cca9c82e219f2129d6 [2021-12-22 00:12:26,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:12:26,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:12:26,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:26,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:12:26,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:12:26,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:26" (1/1) ... [2021-12-22 00:12:26,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6648d3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:26, skipping insertion in model container [2021-12-22 00:12:26,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:26" (1/1) ... [2021-12-22 00:12:26,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:12:27,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:12:27,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2021-12-22 00:12:27,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2021-12-22 00:12:27,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2021-12-22 00:12:27,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2021-12-22 00:12:27,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2021-12-22 00:12:27,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2021-12-22 00:12:27,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:27,242 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:12:27,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2021-12-22 00:12:27,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2021-12-22 00:12:27,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2021-12-22 00:12:27,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2021-12-22 00:12:27,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2021-12-22 00:12:27,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2021-12-22 00:12:27,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:27,338 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:12:27,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27 WrapperNode [2021-12-22 00:12:27,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:27,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:27,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:12:27,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:12:27,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,397 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2021-12-22 00:12:27,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:27,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:12:27,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:12:27,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:12:27,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:12:27,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:12:27,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:12:27,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:12:27,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (1/1) ... [2021-12-22 00:12:27,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:27,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 00:12:27,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 00:12:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 00:12:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 00:12:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:12:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:12:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:12:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:12:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:12:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 00:12:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:12:27,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:12:27,624 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:12:27,625 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:12:28,072 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:12:28,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:12:28,082 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-12-22 00:12:28,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:28 BoogieIcfgContainer [2021-12-22 00:12:28,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:12:28,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:12:28,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:12:28,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:12:28,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:12:26" (1/3) ... [2021-12-22 00:12:28,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45514f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:28, skipping insertion in model container [2021-12-22 00:12:28,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:27" (2/3) ... [2021-12-22 00:12:28,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45514f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:28, skipping insertion in model container [2021-12-22 00:12:28,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:28" (3/3) ... [2021-12-22 00:12:28,092 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2021-12-22 00:12:28,097 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:12:28,097 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-12-22 00:12:28,155 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:12:28,160 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 00:12:28,161 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-12-22 00:12:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:28,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:28,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:28,202 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:28,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 00:12:28,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:28,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494570453] [2021-12-22 00:12:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:28,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:28,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:28,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494570453] [2021-12-22 00:12:28,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494570453] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:28,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:28,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:28,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954079472] [2021-12-22 00:12:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:28,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:28,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:28,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:28,430 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:28,598 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2021-12-22 00:12:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:28,611 INFO L225 Difference]: With dead ends: 182 [2021-12-22 00:12:28,611 INFO L226 Difference]: Without dead ends: 178 [2021-12-22 00:12:28,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:28,617 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:28,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-22 00:12:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2021-12-22 00:12:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2021-12-22 00:12:28,670 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2021-12-22 00:12:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:28,670 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2021-12-22 00:12:28,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2021-12-22 00:12:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:28,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:28,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:28,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 00:12:28,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 00:12:28,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:28,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684229835] [2021-12-22 00:12:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:28,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:28,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-22 00:12:28,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684229835] [2021-12-22 00:12:28,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684229835] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:28,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:28,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:28,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454271006] [2021-12-22 00:12:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:28,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:28,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:28,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:28,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:28,732 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:28,853 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2021-12-22 00:12:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:28,855 INFO L225 Difference]: With dead ends: 175 [2021-12-22 00:12:28,855 INFO L226 Difference]: Without dead ends: 175 [2021-12-22 00:12:28,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:28,856 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:28,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-22 00:12:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2021-12-22 00:12:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2021-12-22 00:12:28,865 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2021-12-22 00:12:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:28,866 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2021-12-22 00:12:28,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2021-12-22 00:12:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 00:12:28,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:28,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:28,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 00:12:28,867 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2021-12-22 00:12:28,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:28,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263277782] [2021-12-22 00:12:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:28,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:28,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:28,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263277782] [2021-12-22 00:12:28,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263277782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:28,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:28,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:12:28,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629456538] [2021-12-22 00:12:28,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:28,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:28,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:29,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:29,001 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:29,200 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2021-12-22 00:12:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:29,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-22 00:12:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:29,202 INFO L225 Difference]: With dead ends: 178 [2021-12-22 00:12:29,202 INFO L226 Difference]: Without dead ends: 178 [2021-12-22 00:12:29,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:29,203 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 294 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:29,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 89 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-22 00:12:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2021-12-22 00:12:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2021-12-22 00:12:29,211 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2021-12-22 00:12:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:29,211 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2021-12-22 00:12:29,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2021-12-22 00:12:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 00:12:29,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:29,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:29,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 00:12:29,213 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2021-12-22 00:12:29,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:29,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005584328] [2021-12-22 00:12:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:29,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:29,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:29,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005584328] [2021-12-22 00:12:29,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005584328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:29,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:29,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:29,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706274177] [2021-12-22 00:12:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:29,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:29,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:29,314 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:29,581 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2021-12-22 00:12:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:29,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-22 00:12:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:29,583 INFO L225 Difference]: With dead ends: 258 [2021-12-22 00:12:29,583 INFO L226 Difference]: Without dead ends: 258 [2021-12-22 00:12:29,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:29,584 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 437 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:29,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 130 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-22 00:12:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2021-12-22 00:12:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2021-12-22 00:12:29,593 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2021-12-22 00:12:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:29,593 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2021-12-22 00:12:29,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2021-12-22 00:12:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 00:12:29,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:29,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:29,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 00:12:29,594 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2021-12-22 00:12:29,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:29,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839838145] [2021-12-22 00:12:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:29,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:29,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:29,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839838145] [2021-12-22 00:12:29,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839838145] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:29,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:29,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:12:29,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118694294] [2021-12-22 00:12:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:29,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:29,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:29,632 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:29,648 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2021-12-22 00:12:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:29,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 00:12:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:29,656 INFO L225 Difference]: With dead ends: 266 [2021-12-22 00:12:29,657 INFO L226 Difference]: Without dead ends: 266 [2021-12-22 00:12:29,657 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-22 00:12:29,658 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 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-22 00:12:29,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:12:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-22 00:12:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2021-12-22 00:12:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 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-22 00:12:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2021-12-22 00:12:29,666 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2021-12-22 00:12:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:29,666 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2021-12-22 00:12:29,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2021-12-22 00:12:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:12:29,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:29,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:29,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 00:12:29,667 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-22 00:12:29,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:29,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883269830] [2021-12-22 00:12:29,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:29,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:29,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-22 00:12:29,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:29,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883269830] [2021-12-22 00:12:29,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883269830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:29,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:29,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:12:29,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972323761] [2021-12-22 00:12:29,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:29,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:12:29,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:12:29,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:29,738 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:29,915 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2021-12-22 00:12:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:29,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:12:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:29,917 INFO L225 Difference]: With dead ends: 232 [2021-12-22 00:12:29,917 INFO L226 Difference]: Without dead ends: 232 [2021-12-22 00:12:29,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:29,918 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:29,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-22 00:12:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-12-22 00:12:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2021-12-22 00:12:29,927 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2021-12-22 00:12:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:29,928 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2021-12-22 00:12:29,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2021-12-22 00:12:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:12:29,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:29,929 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:29,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 00:12:29,929 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:29,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-22 00:12:29,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:29,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025103365] [2021-12-22 00:12:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:29,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:29,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:29,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025103365] [2021-12-22 00:12:29,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025103365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:29,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:29,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:12:29,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615310510] [2021-12-22 00:12:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:29,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:12:29,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:12:29,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:29,998 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:30,152 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2021-12-22 00:12:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:12:30,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:12:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:30,153 INFO L225 Difference]: With dead ends: 231 [2021-12-22 00:12:30,153 INFO L226 Difference]: Without dead ends: 231 [2021-12-22 00:12:30,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:30,154 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:30,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 426 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-22 00:12:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-12-22 00:12:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2021-12-22 00:12:30,159 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2021-12-22 00:12:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:30,159 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2021-12-22 00:12:30,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2021-12-22 00:12:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 00:12:30,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:30,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:30,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 00:12:30,160 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-22 00:12:30,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:30,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371817343] [2021-12-22 00:12:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:30,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:30,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:30,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371817343] [2021-12-22 00:12:30,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371817343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:30,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:30,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:12:30,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351606280] [2021-12-22 00:12:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:30,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:12:30,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:30,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:12:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:12:30,279 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:30,592 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2021-12-22 00:12:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:12:30,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 00:12:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:30,596 INFO L225 Difference]: With dead ends: 237 [2021-12-22 00:12:30,596 INFO L226 Difference]: Without dead ends: 237 [2021-12-22 00:12:30,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:12:30,597 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 291 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:30,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 289 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-22 00:12:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2021-12-22 00:12:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2021-12-22 00:12:30,602 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2021-12-22 00:12:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:30,603 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2021-12-22 00:12:30,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2021-12-22 00:12:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 00:12:30,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:30,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:30,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 00:12:30,603 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-22 00:12:30,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:30,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029632870] [2021-12-22 00:12:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:30,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:30,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:30,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029632870] [2021-12-22 00:12:30,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029632870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:30,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:30,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:12:30,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557656641] [2021-12-22 00:12:30,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:30,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:12:30,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:30,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:12:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:12:30,750 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:31,275 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2021-12-22 00:12:31,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 00:12:31,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 00:12:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:31,277 INFO L225 Difference]: With dead ends: 232 [2021-12-22 00:12:31,277 INFO L226 Difference]: Without dead ends: 232 [2021-12-22 00:12:31,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-22 00:12:31,278 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:31,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 388 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:12:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-22 00:12:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2021-12-22 00:12:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2021-12-22 00:12:31,281 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2021-12-22 00:12:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:31,282 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2021-12-22 00:12:31,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2021-12-22 00:12:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 00:12:31,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:31,283 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] [2021-12-22 00:12:31,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 00:12:31,283 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2021-12-22 00:12:31,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:31,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573192401] [2021-12-22 00:12:31,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:31,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:31,325 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-22 00:12:31,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:31,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573192401] [2021-12-22 00:12:31,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573192401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:31,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:31,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:12:31,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317252068] [2021-12-22 00:12:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:31,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:31,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:31,328 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:31,445 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2021-12-22 00:12:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:12:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 25 [2021-12-22 00:12:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:31,446 INFO L225 Difference]: With dead ends: 253 [2021-12-22 00:12:31,447 INFO L226 Difference]: Without dead ends: 253 [2021-12-22 00:12:31,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:31,448 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 295 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:31,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:31,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-12-22 00:12:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2021-12-22 00:12:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) 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-22 00:12:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2021-12-22 00:12:31,453 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2021-12-22 00:12:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:31,453 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2021-12-22 00:12:31,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2021-12-22 00:12:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 00:12:31,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:31,454 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] [2021-12-22 00:12:31,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 00:12:31,455 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2021-12-22 00:12:31,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:31,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158042755] [2021-12-22 00:12:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:31,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:31,651 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-22 00:12:31,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:31,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158042755] [2021-12-22 00:12:31,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158042755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:31,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847266374] [2021-12-22 00:12:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:31,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:31,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:31,653 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-22 00:12:31,654 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-22 00:12:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:31,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-22 00:12:31,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:31,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:31,919 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:31,920 INFO L387 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-22 00:12:31,986 INFO L387 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-22 00:12:32,088 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:32,089 INFO L387 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 19 treesize of output 22 [2021-12-22 00:12:32,187 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:32,189 INFO L387 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-22 00:12:32,262 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:32,262 INFO L387 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-22 00:12:32,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:32,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:32,413 INFO L387 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-22 00:12:32,418 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-22 00:12:32,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:32,658 INFO L353 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-22 00:12:32,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-22 00:12:32,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2021-12-22 00:12:32,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2021-12-22 00:12:32,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (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_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2021-12-22 00:12:32,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2021-12-22 00:12:32,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2021-12-22 00:12:32,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:32,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2021-12-22 00:12:32,793 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:32,793 INFO L387 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 170 treesize of output 137 [2021-12-22 00:12:32,800 INFO L387 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 122 treesize of output 114 [2021-12-22 00:12:32,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:32,810 INFO L387 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 114 treesize of output 102 [2021-12-22 00:12:33,651 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-22 00:12:33,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847266374] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:33,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:33,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2021-12-22 00:12:33,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044267084] [2021-12-22 00:12:33,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:33,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-22 00:12:33,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:33,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-22 00:12:33,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=780, Unknown=8, NotChecked=300, Total=1190 [2021-12-22 00:12:33,655 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:35,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:35,219 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2021-12-22 00:12:35,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-22 00:12:35,220 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 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-22 00:12:35,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:35,222 INFO L225 Difference]: With dead ends: 505 [2021-12-22 00:12:35,222 INFO L226 Difference]: Without dead ends: 505 [2021-12-22 00:12:35,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1728, Unknown=8, NotChecked=460, Total=2550 [2021-12-22 00:12:35,223 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 773 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1883 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:35,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 1654 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1611 Invalid, 0 Unknown, 1883 Unchecked, 0.8s Time] [2021-12-22 00:12:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-22 00:12:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 239. [2021-12-22 00:12:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 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-22 00:12:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2021-12-22 00:12:35,231 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2021-12-22 00:12:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:35,232 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2021-12-22 00:12:35,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2021-12-22 00:12:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 00:12:35,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:35,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] [2021-12-22 00:12:35,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:35,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-22 00:12:35,436 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:35,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2021-12-22 00:12:35,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:35,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885526367] [2021-12-22 00:12:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:35,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:35,719 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-22 00:12:35,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:35,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885526367] [2021-12-22 00:12:35,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885526367] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:35,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716325874] [2021-12-22 00:12:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:35,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:35,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:35,721 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-22 00:12:35,723 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-22 00:12:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:35,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-22 00:12:35,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:35,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:35,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:35,923 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:35,924 INFO L387 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-22 00:12:35,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:35,968 INFO L387 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-22 00:12:36,084 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:36,084 INFO L387 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-22 00:12:36,090 INFO L387 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-22 00:12:36,202 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:36,202 INFO L387 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-22 00:12:36,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:36,214 INFO L387 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 14 treesize of output 16 [2021-12-22 00:12:36,275 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:36,275 INFO L387 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-22 00:12:36,280 INFO L387 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-22 00:12:36,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:36,484 INFO L387 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-22 00:12:36,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:36,489 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:36,489 INFO L387 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-22 00:12:36,510 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-22 00:12:36,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:39,612 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:39,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 105 [2021-12-22 00:12:39,618 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:39,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 81 [2021-12-22 00:12:39,633 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:39,633 INFO L387 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 688 treesize of output 619 [2021-12-22 00:12:39,656 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:39,657 INFO L387 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 3027 treesize of output 2898 [2021-12-22 00:12:39,704 INFO L387 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 2867 treesize of output 2739 [2021-12-22 00:12:39,725 INFO L387 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 2739 treesize of output 2675 [2021-12-22 00:12:39,746 INFO L387 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 2675 treesize of output 2547 [2021-12-22 00:12:39,768 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:39,768 INFO L387 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 2547 treesize of output 2384 [2021-12-22 00:12:39,789 INFO L387 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 2375 treesize of output 2367 [2021-12-22 00:12:39,814 INFO L387 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 2367 treesize of output 2363 [2021-12-22 00:12:39,834 INFO L387 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 2363 treesize of output 2355 [2021-12-22 00:12:39,850 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-22 00:12:39,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-22 00:12:39,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-22 00:12:39,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700447300] [2021-12-22 00:12:39,851 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:39,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 00:12:39,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 00:12:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=919, Unknown=22, NotChecked=0, Total=1056 [2021-12-22 00:12:39,852 INFO L87 Difference]: Start difference. First operand 239 states and 284 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 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-22 00:12:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:40,952 INFO L93 Difference]: Finished difference Result 413 states and 465 transitions. [2021-12-22 00:12:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 00:12:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 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-22 00:12:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:40,954 INFO L225 Difference]: With dead ends: 413 [2021-12-22 00:12:40,954 INFO L226 Difference]: Without dead ends: 413 [2021-12-22 00:12:40,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=265, Invalid=1783, Unknown=22, NotChecked=0, Total=2070 [2021-12-22 00:12:40,955 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 782 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:40,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 582 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 00:12:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-22 00:12:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 239. [2021-12-22 00:12:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 238 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2021-12-22 00:12:40,961 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2021-12-22 00:12:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:40,961 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2021-12-22 00:12:40,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 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-22 00:12:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2021-12-22 00:12:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 00:12:40,963 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:40,963 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] [2021-12-22 00:12:40,985 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-22 00:12:41,179 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,SelfDestructingSolverStorable11 [2021-12-22 00:12:41,180 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2021-12-22 00:12:41,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:41,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684140291] [2021-12-22 00:12:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:41,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 00:12:41,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:41,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684140291] [2021-12-22 00:12:41,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684140291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:41,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:41,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:12:41,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296020479] [2021-12-22 00:12:41,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:41,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:41,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:41,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:41,215 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:41,222 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2021-12-22 00:12:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:41,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-22 00:12:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:41,223 INFO L225 Difference]: With dead ends: 241 [2021-12-22 00:12:41,223 INFO L226 Difference]: Without dead ends: 241 [2021-12-22 00:12:41,224 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-22 00:12:41,224 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 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-22 00:12:41,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:12:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-22 00:12:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-12-22 00:12:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2021-12-22 00:12:41,230 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2021-12-22 00:12:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:41,230 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2021-12-22 00:12:41,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2021-12-22 00:12:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:12:41,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:41,231 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-22 00:12:41,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 00:12:41,232 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2021-12-22 00:12:41,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210369854] [2021-12-22 00:12:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:41,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:41,305 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-22 00:12:41,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:41,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210369854] [2021-12-22 00:12:41,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210369854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:41,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:41,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:12:41,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753619248] [2021-12-22 00:12:41,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:41,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:12:41,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:41,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:12:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:41,308 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-22 00:12:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:41,519 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2021-12-22 00:12:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:12:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-22 00:12:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:41,521 INFO L225 Difference]: With dead ends: 258 [2021-12-22 00:12:41,521 INFO L226 Difference]: Without dead ends: 258 [2021-12-22 00:12:41,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:12:41,522 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:41,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 619 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-22 00:12:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2021-12-22 00:12:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 203 states have (on average 1.4482758620689655) internal successors, (294), 248 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2021-12-22 00:12:41,527 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2021-12-22 00:12:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:41,527 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2021-12-22 00:12:41,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-22 00:12:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2021-12-22 00:12:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:12:41,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:41,528 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-22 00:12:41,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 00:12:41,529 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2021-12-22 00:12:41,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:41,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705456161] [2021-12-22 00:12:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:41,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:41,560 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-22 00:12:41,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:41,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705456161] [2021-12-22 00:12:41,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705456161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:41,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:41,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:41,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466664242] [2021-12-22 00:12:41,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:41,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:41,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:41,562 INFO L87 Difference]: Start difference. First operand 249 states and 294 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-22 00:12:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:41,625 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2021-12-22 00:12:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:41,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-22 00:12:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:41,627 INFO L225 Difference]: With dead ends: 246 [2021-12-22 00:12:41,627 INFO L226 Difference]: Without dead ends: 246 [2021-12-22 00:12:41,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:41,632 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:41,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-22 00:12:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2021-12-22 00:12:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 244 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2021-12-22 00:12:41,637 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2021-12-22 00:12:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:41,638 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2021-12-22 00:12:41,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-22 00:12:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2021-12-22 00:12:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:12:41,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:41,639 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-22 00:12:41,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 00:12:41,639 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:41,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2021-12-22 00:12:41,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:41,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561270475] [2021-12-22 00:12:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:41,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:41,683 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-22 00:12:41,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561270475] [2021-12-22 00:12:41,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561270475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:41,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:41,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:41,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269764245] [2021-12-22 00:12:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:41,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:41,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:41,685 INFO L87 Difference]: Start difference. First operand 245 states and 286 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-22 00:12:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:41,751 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2021-12-22 00:12:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-22 00:12:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:41,752 INFO L225 Difference]: With dead ends: 241 [2021-12-22 00:12:41,753 INFO L226 Difference]: Without dead ends: 241 [2021-12-22 00:12:41,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:41,753 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:41,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-22 00:12:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-12-22 00:12:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 240 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2021-12-22 00:12:41,758 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2021-12-22 00:12:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:41,758 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2021-12-22 00:12:41,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-22 00:12:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2021-12-22 00:12:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:12:41,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:41,759 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-22 00:12:41,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 00:12:41,760 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2021-12-22 00:12:41,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:41,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110543680] [2021-12-22 00:12:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:41,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 00:12:41,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:41,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110543680] [2021-12-22 00:12:41,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110543680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:41,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:41,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:41,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095810801] [2021-12-22 00:12:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:41,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:41,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:41,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:41,808 INFO L87 Difference]: Start difference. First operand 241 states and 278 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-22 00:12:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:42,039 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2021-12-22 00:12:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:42,040 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-22 00:12:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:42,041 INFO L225 Difference]: With dead ends: 261 [2021-12-22 00:12:42,041 INFO L226 Difference]: Without dead ends: 261 [2021-12-22 00:12:42,041 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-22 00:12:42,041 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:42,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 335 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-22 00:12:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2021-12-22 00:12:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 239 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2021-12-22 00:12:42,045 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2021-12-22 00:12:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:42,046 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2021-12-22 00:12:42,046 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-22 00:12:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2021-12-22 00:12:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:12:42,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:42,046 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-22 00:12:42,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 00:12:42,046 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:42,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2021-12-22 00:12:42,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:42,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029443981] [2021-12-22 00:12:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:42,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:42,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029443981] [2021-12-22 00:12:42,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029443981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542008155] [2021-12-22 00:12:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:42,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:42,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:42,320 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-22 00:12:42,320 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-22 00:12:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:42,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-22 00:12:42,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:42,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:42,516 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:42,516 INFO L387 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-22 00:12:42,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:42,563 INFO L387 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-22 00:12:42,670 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:42,671 INFO L387 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 29 treesize of output 30 [2021-12-22 00:12:42,675 INFO L387 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-22 00:12:42,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 00:12:42,757 INFO L387 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 14 treesize of output 16 [2021-12-22 00:12:42,789 INFO L387 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 14 treesize of output 16 [2021-12-22 00:12:43,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-22 00:12:43,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:43,029 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:43,029 INFO L387 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 26 treesize of output 17 [2021-12-22 00:12:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:43,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:43,169 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:43,169 INFO L387 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 32 treesize of output 36 [2021-12-22 00:12:43,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_78| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-22 00:12:43,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_78| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-22 00:12:43,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (<= 0 (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_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_78| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-22 00:12:43,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_78| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-22 00:12:43,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (<= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_78| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-22 00:12:43,544 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:43,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-22 00:12:43,550 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:43,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-22 00:12:43,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2021-12-22 00:12:43,566 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:43,566 INFO L387 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 100 treesize of output 99 [2021-12-22 00:12:43,572 INFO L387 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 52 [2021-12-22 00:12:43,578 INFO L387 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 52 treesize of output 50 [2021-12-22 00:12:43,582 INFO L387 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 74 treesize of output 68 [2021-12-22 00:12:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:43,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542008155] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:43,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:43,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2021-12-22 00:12:43,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117427264] [2021-12-22 00:12:43,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:43,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-22 00:12:43,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:43,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-22 00:12:43,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1396, Unknown=5, NotChecked=400, Total=1980 [2021-12-22 00:12:43,993 INFO L87 Difference]: Start difference. First operand 240 states and 277 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:46,078 INFO L93 Difference]: Finished difference Result 343 states and 389 transitions. [2021-12-22 00:12:46,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-22 00:12:46,079 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 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-22 00:12:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:46,080 INFO L225 Difference]: With dead ends: 343 [2021-12-22 00:12:46,080 INFO L226 Difference]: Without dead ends: 343 [2021-12-22 00:12:46,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=682, Invalid=3754, Unknown=6, NotChecked=670, Total=5112 [2021-12-22 00:12:46,082 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 456 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1232 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:46,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 2369 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2211 Invalid, 0 Unknown, 1232 Unchecked, 1.1s Time] [2021-12-22 00:12:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-22 00:12:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 227. [2021-12-22 00:12:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.3248730964467006) internal successors, (261), 226 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-22 00:12:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2021-12-22 00:12:46,086 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 36 [2021-12-22 00:12:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:46,087 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2021-12-22 00:12:46,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2021-12-22 00:12:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-22 00:12:46,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:46,088 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, 1, 1] [2021-12-22 00:12:46,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:46,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-22 00:12:46,289 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2021-12-22 00:12:46,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:46,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058366657] [2021-12-22 00:12:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:46,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:46,353 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-22 00:12:46,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058366657] [2021-12-22 00:12:46,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058366657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:46,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:46,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:46,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481788404] [2021-12-22 00:12:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:46,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:46,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:46,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:46,356 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:46,578 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2021-12-22 00:12:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 40 [2021-12-22 00:12:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:46,580 INFO L225 Difference]: With dead ends: 247 [2021-12-22 00:12:46,580 INFO L226 Difference]: Without dead ends: 247 [2021-12-22 00:12:46,580 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-22 00:12:46,581 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:46,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 334 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-22 00:12:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2021-12-22 00:12:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 232 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2021-12-22 00:12:46,585 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 40 [2021-12-22 00:12:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:46,585 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2021-12-22 00:12:46,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2021-12-22 00:12:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-22 00:12:46,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:46,586 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, 1, 1] [2021-12-22 00:12:46,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 00:12:46,587 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:46,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:46,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2021-12-22 00:12:46,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:46,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806345125] [2021-12-22 00:12:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:46,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:46,874 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-22 00:12:46,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806345125] [2021-12-22 00:12:46,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806345125] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451502667] [2021-12-22 00:12:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:46,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:46,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:46,876 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-22 00:12:46,877 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-22 00:12:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:46,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 00:12:46,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:47,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-22 00:12:47,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-22 00:12:47,168 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-22 00:12:47,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:47,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451502667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:47,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 00:12:47,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2021-12-22 00:12:47,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141041097] [2021-12-22 00:12:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:47,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:47,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-12-22 00:12:47,170 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:47,410 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2021-12-22 00:12:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 40 [2021-12-22 00:12:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:47,412 INFO L225 Difference]: With dead ends: 242 [2021-12-22 00:12:47,412 INFO L226 Difference]: Without dead ends: 242 [2021-12-22 00:12:47,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-12-22 00:12:47,413 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:47,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-22 00:12:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 231. [2021-12-22 00:12:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 230 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2021-12-22 00:12:47,418 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 40 [2021-12-22 00:12:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:47,418 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2021-12-22 00:12:47,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2021-12-22 00:12:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-22 00:12:47,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:47,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-22 00:12:47,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:47,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:47,634 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-22 00:12:47,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2021-12-22 00:12:47,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:47,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612111503] [2021-12-22 00:12:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:47,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:47,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:47,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612111503] [2021-12-22 00:12:47,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612111503] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:47,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374367720] [2021-12-22 00:12:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:47,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:47,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:47,952 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-22 00:12:47,953 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-22 00:12:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-22 00:12:48,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:48,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:48,151 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:48,152 INFO L387 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-22 00:12:48,191 INFO L387 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-22 00:12:48,278 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:48,279 INFO L387 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 19 treesize of output 22 [2021-12-22 00:12:48,371 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-22 00:12:48,372 INFO L387 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 19 treesize of output 18 [2021-12-22 00:12:48,388 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-22 00:12:48,389 INFO L387 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 27 treesize of output 22 [2021-12-22 00:12:48,486 INFO L353 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2021-12-22 00:12:48,487 INFO L387 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 89 treesize of output 70 [2021-12-22 00:12:48,497 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-22 00:12:48,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2021-12-22 00:12:48,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:48,928 INFO L353 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2021-12-22 00:12:48,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 45 [2021-12-22 00:12:48,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:48,939 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:12:48,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2021-12-22 00:12:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:48,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:13:03,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:13:03,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 3620 treesize of output 2579