./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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-01-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 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:04:23,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:04:23,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:04:23,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:04:23,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:04:23,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:04:23,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:04:23,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:04:23,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:04:23,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:04:23,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:04:23,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:04:23,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:04:23,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:04:23,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:04:23,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:04:23,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:04:23,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:04:23,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:04:23,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:04:23,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:04:23,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:04:23,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:04:23,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:04:23,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:04:23,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:04:23,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:04:23,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:04:23,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:04:23,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:04:23,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:04:23,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:04:23,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:04:23,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:04:23,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:04:23,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:04:23,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:04:23,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:04:23,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:04:23,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:04:23,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:04:23,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:04:23,246 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:04:23,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:04:23,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:04:23,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:04:23,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:04:23,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:04:23,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:04:23,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:04:23,249 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:04:23,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:04:23,250 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:04:23,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:04:23,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:04:23,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:04:23,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:04:23,251 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:04:23,251 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:04:23,251 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:04:23,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:04:23,252 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:04:23,252 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:04:23,252 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:04:23,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:04:23,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:04:23,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:04:23,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:23,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:04:23,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:04:23,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:04:23,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:04:23,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:04:23,253 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 -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2021-12-15 14:04:23,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:04:23,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:04:23,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:04:23,451 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:04:23,451 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:04:23,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2021-12-15 14:04:23,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c9aea40/9e2c6717c7134fd2bd25a95300c1a547/FLAGe4fe7331c [2021-12-15 14:04:23,972 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:04:23,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2021-12-15 14:04:23,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c9aea40/9e2c6717c7134fd2bd25a95300c1a547/FLAGe4fe7331c [2021-12-15 14:04:24,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c9aea40/9e2c6717c7134fd2bd25a95300c1a547 [2021-12-15 14:04:24,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:04:24,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:04:24,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:24,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:04:24,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:04:24,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f4e899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24, skipping insertion in model container [2021-12-15 14:04:24,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:04:24,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:04:24,731 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-01-2.i[22080,22093] [2021-12-15 14:04:24,743 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-01-2.i[22353,22366] [2021-12-15 14:04:24,745 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-01-2.i[22587,22600] [2021-12-15 14:04:24,746 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-01-2.i[22657,22670] [2021-12-15 14:04:24,747 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-01-2.i[22924,22937] [2021-12-15 14:04:24,748 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-01-2.i[23032,23045] [2021-12-15 14:04:24,750 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-01-2.i[23263,23276] [2021-12-15 14:04:24,752 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-01-2.i[23343,23356] [2021-12-15 14:04:24,752 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-01-2.i[23422,23435] [2021-12-15 14:04:24,753 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-01-2.i[23512,23525] [2021-12-15 14:04:24,754 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-01-2.i[23690,23703] [2021-12-15 14:04:24,756 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-01-2.i[23768,23781] [2021-12-15 14:04:24,756 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-01-2.i[23845,23858] [2021-12-15 14:04:24,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:24,763 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:04:24,782 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-01-2.i[22080,22093] [2021-12-15 14:04:24,790 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-01-2.i[22353,22366] [2021-12-15 14:04:24,796 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-01-2.i[22587,22600] [2021-12-15 14:04:24,797 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-01-2.i[22657,22670] [2021-12-15 14:04:24,798 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-01-2.i[22924,22937] [2021-12-15 14:04:24,799 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-01-2.i[23032,23045] [2021-12-15 14:04:24,800 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-01-2.i[23263,23276] [2021-12-15 14:04:24,800 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-01-2.i[23343,23356] [2021-12-15 14:04:24,801 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-01-2.i[23422,23435] [2021-12-15 14:04:24,801 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-01-2.i[23512,23525] [2021-12-15 14:04:24,802 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-01-2.i[23690,23703] [2021-12-15 14:04:24,803 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-01-2.i[23768,23781] [2021-12-15 14:04:24,803 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-01-2.i[23845,23858] [2021-12-15 14:04:24,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:24,820 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:04:24,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24 WrapperNode [2021-12-15 14:04:24,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:24,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:24,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:04:24,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:04:24,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,856 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2021-12-15 14:04:24,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:24,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:04:24,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:04:24,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:04:24,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:04:24,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:04:24,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:04:24,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:04:24,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:24,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:24,911 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-15 14:04:24,945 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-15 14:04:24,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:04:24,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:04:24,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:04:24,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:04:24,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:04:24,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:04:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:04:24,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:04:25,027 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:04:25,029 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:04:25,440 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:04:25,446 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:04:25,446 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-15 14:04:25,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25 BoogieIcfgContainer [2021-12-15 14:04:25,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:04:25,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:04:25,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:04:25,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:04:25,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:04:24" (1/3) ... [2021-12-15 14:04:25,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37872c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24" (2/3) ... [2021-12-15 14:04:25,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37872c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25" (3/3) ... [2021-12-15 14:04:25,461 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2021-12-15 14:04:25,469 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:04:25,469 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2021-12-15 14:04:25,510 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:04:25,515 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-15 14:04:25,515 INFO L340 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2021-12-15 14:04:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:25,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:25,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:25,533 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:04:25,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:25,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337679300] [2021-12-15 14:04:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:25,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:25,674 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-15 14:04:25,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:25,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337679300] [2021-12-15 14:04:25,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337679300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:25,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:25,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:25,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120504133] [2021-12-15 14:04:25,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:25,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:25,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:25,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:25,708 INFO L87 Difference]: Start difference. First operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 14:04:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:25,864 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-12-15 14:04:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:25,867 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-15 14:04:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:25,874 INFO L225 Difference]: With dead ends: 201 [2021-12-15 14:04:25,875 INFO L226 Difference]: Without dead ends: 197 [2021-12-15 14:04:25,876 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-15 14:04:25,879 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:25,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 124 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-15 14:04:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2021-12-15 14:04:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 192 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2021-12-15 14:04:25,937 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 3 [2021-12-15 14:04:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:25,940 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2021-12-15 14:04:25,941 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-15 14:04:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2021-12-15 14:04:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:25,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:25,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:25,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:04:25,943 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:04:25,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:25,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397973587] [2021-12-15 14:04:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:25,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,021 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-15 14:04:26,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397973587] [2021-12-15 14:04:26,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397973587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:26,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410240963] [2021-12-15 14:04:26,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:26,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,028 INFO L87 Difference]: Start difference. First operand 193 states and 204 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-15 14:04:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,181 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2021-12-15 14:04:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,182 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-15 14:04:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,183 INFO L225 Difference]: With dead ends: 222 [2021-12-15 14:04:26,183 INFO L226 Difference]: Without dead ends: 222 [2021-12-15 14:04:26,183 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-15 14:04:26,184 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 181 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-15 14:04:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-12-15 14:04:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.671641791044776) internal successors, (224), 201 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-12-15 14:04:26,194 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 3 [2021-12-15 14:04:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,195 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-12-15 14:04:26,195 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-15 14:04:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-12-15 14:04:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:04:26,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:04:26,196 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2021-12-15 14:04:26,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617864650] [2021-12-15 14:04:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,227 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-15 14:04:26,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617864650] [2021-12-15 14:04:26,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617864650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:26,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939444483] [2021-12-15 14:04:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:26,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,230 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,265 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2021-12-15 14:04:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-15 14:04:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,266 INFO L225 Difference]: With dead ends: 217 [2021-12-15 14:04:26,268 INFO L226 Difference]: Without dead ends: 217 [2021-12-15 14:04:26,268 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-15 14:04:26,269 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 177 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 204 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-15 14:04:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-12-15 14:04:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 199 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2021-12-15 14:04:26,287 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 6 [2021-12-15 14:04:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,287 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2021-12-15 14:04:26,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2021-12-15 14:04:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:04:26,289 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2021-12-15 14:04:26,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156259461] [2021-12-15 14:04:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,372 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-15 14:04:26,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156259461] [2021-12-15 14:04:26,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156259461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091531622] [2021-12-15 14:04:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,375 INFO L87 Difference]: Start difference. First operand 200 states and 221 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-15 14:04:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,523 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2021-12-15 14:04:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:26,523 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-15 14:04:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,524 INFO L225 Difference]: With dead ends: 199 [2021-12-15 14:04:26,524 INFO L226 Difference]: Without dead ends: 199 [2021-12-15 14:04:26,525 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-15 14:04:26,527 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 4 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 539 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-15 14:04:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-15 14:04:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2021-12-15 14:04:26,549 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 12 [2021-12-15 14:04:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,550 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2021-12-15 14:04:26,550 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-15 14:04:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2021-12-15 14:04:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:04:26,551 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2021-12-15 14:04:26,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578301255] [2021-12-15 14:04:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,653 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-15 14:04:26,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578301255] [2021-12-15 14:04:26,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578301255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952558051] [2021-12-15 14:04:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:26,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,659 INFO L87 Difference]: Start difference. First operand 199 states and 220 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-15 14:04:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,809 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-12-15 14:04:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:26,810 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-15 14:04:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,811 INFO L225 Difference]: With dead ends: 198 [2021-12-15 14:04:26,811 INFO L226 Difference]: Without dead ends: 198 [2021-12-15 14:04:26,811 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-15 14:04:26,812 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 548 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-15 14:04:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-15 14:04:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2021-12-15 14:04:26,819 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 12 [2021-12-15 14:04:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,820 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2021-12-15 14:04:26,820 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-15 14:04:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2021-12-15 14:04:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 14:04:26,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:04:26,821 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2021-12-15 14:04:26,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652344005] [2021-12-15 14:04:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,848 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-15 14:04:26,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652344005] [2021-12-15 14:04:26,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652344005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:26,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453279303] [2021-12-15 14:04:26,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:26,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:26,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,850 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,858 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2021-12-15 14:04:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 14:04:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,859 INFO L225 Difference]: With dead ends: 199 [2021-12-15 14:04:26,859 INFO L226 Difference]: Without dead ends: 199 [2021-12-15 14:04:26,860 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-15 14:04:26,861 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 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-15 14:04:26,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-15 14:04:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-15 14:04:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2021-12-15 14:04:26,866 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 14 [2021-12-15 14:04:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,866 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2021-12-15 14:04:26,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2021-12-15 14:04:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:04:26,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:04:26,868 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2021-12-15 14:04:26,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074016317] [2021-12-15 14:04:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074016317] [2021-12-15 14:04:26,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074016317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:26,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125724980] [2021-12-15 14:04:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:26,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:26,950 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,162 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-12-15 14:04:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:27,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:04:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,164 INFO L225 Difference]: With dead ends: 198 [2021-12-15 14:04:27,164 INFO L226 Difference]: Without dead ends: 198 [2021-12-15 14:04:27,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:27,164 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 456 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-15 14:04:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-15 14:04:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2021-12-15 14:04:27,169 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 15 [2021-12-15 14:04:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,169 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2021-12-15 14:04:27,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2021-12-15 14:04:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:04:27,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:04:27,170 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2021-12-15 14:04:27,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555704661] [2021-12-15 14:04:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,261 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-15 14:04:27,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555704661] [2021-12-15 14:04:27,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555704661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:27,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932275123] [2021-12-15 14:04:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:27,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:27,264 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,609 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2021-12-15 14:04:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:27,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:04:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,610 INFO L225 Difference]: With dead ends: 197 [2021-12-15 14:04:27,610 INFO L226 Difference]: Without dead ends: 197 [2021-12-15 14:04:27,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:27,610 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 169 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 577 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-15 14:04:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-15 14:04:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.626865671641791) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2021-12-15 14:04:27,614 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 15 [2021-12-15 14:04:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,614 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2021-12-15 14:04:27,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2021-12-15 14:04:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:27,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:04:27,615 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2021-12-15 14:04:27,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578392201] [2021-12-15 14:04:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,704 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-15 14:04:27,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578392201] [2021-12-15 14:04:27,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578392201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:27,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474232393] [2021-12-15 14:04:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:27,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:27,707 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-15 14:04:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,896 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2021-12-15 14:04:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-15 14:04:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,897 INFO L225 Difference]: With dead ends: 289 [2021-12-15 14:04:27,897 INFO L226 Difference]: Without dead ends: 289 [2021-12-15 14:04:27,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:04:27,898 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 199 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 651 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-15 14:04:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-12-15 14:04:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.628787878787879) internal successors, (215), 193 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2021-12-15 14:04:27,901 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 16 [2021-12-15 14:04:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,907 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2021-12-15 14:04:27,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-15 14:04:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2021-12-15 14:04:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:04:27,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:04:27,909 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2021-12-15 14:04:27,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845294871] [2021-12-15 14:04:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,959 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-15 14:04:27,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845294871] [2021-12-15 14:04:27,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845294871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:27,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428156810] [2021-12-15 14:04:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:27,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:27,961 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,064 INFO L93 Difference]: Finished difference Result 290 states and 316 transitions. [2021-12-15 14:04:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:04:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,065 INFO L225 Difference]: With dead ends: 290 [2021-12-15 14:04:28,065 INFO L226 Difference]: Without dead ends: 290 [2021-12-15 14:04:28,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:28,066 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 614 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-15 14:04:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-12-15 14:04:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.614814814814815) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2021-12-15 14:04:28,070 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 18 [2021-12-15 14:04:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,070 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2021-12-15 14:04:28,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2021-12-15 14:04:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:04:28,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:04:28,071 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:28,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2021-12-15 14:04:28,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11174822] [2021-12-15 14:04:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,130 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-15 14:04:28,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11174822] [2021-12-15 14:04:28,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11174822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:28,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061126286] [2021-12-15 14:04:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:28,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:28,131 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,261 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-15 14:04:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 14:04:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,262 INFO L225 Difference]: With dead ends: 191 [2021-12-15 14:04:28,262 INFO L226 Difference]: Without dead ends: 191 [2021-12-15 14:04:28,262 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-15 14:04:28,263 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 257 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 118 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-15 14:04:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2021-12-15 14:04:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 186 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2021-12-15 14:04:28,267 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 20 [2021-12-15 14:04:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,268 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2021-12-15 14:04:28,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2021-12-15 14:04:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:04:28,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:04:28,269 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2021-12-15 14:04:28,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842897121] [2021-12-15 14:04:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,332 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-15 14:04:28,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842897121] [2021-12-15 14:04:28,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842897121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:28,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026115172] [2021-12-15 14:04:28,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:28,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:28,334 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,556 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2021-12-15 14:04:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 14:04:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,558 INFO L225 Difference]: With dead ends: 248 [2021-12-15 14:04:28,558 INFO L226 Difference]: Without dead ends: 248 [2021-12-15 14:04:28,558 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-15 14:04:28,558 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 449 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 255 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-15 14:04:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2021-12-15 14:04:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 210 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2021-12-15 14:04:28,562 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 20 [2021-12-15 14:04:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,562 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2021-12-15 14:04:28,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2021-12-15 14:04:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:04:28,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:04:28,563 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2021-12-15 14:04:28,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811969712] [2021-12-15 14:04:28,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,622 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-15 14:04:28,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811969712] [2021-12-15 14:04:28,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811969712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:28,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734756219] [2021-12-15 14:04:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:28,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:28,625 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,762 INFO L93 Difference]: Finished difference Result 243 states and 256 transitions. [2021-12-15 14:04:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-15 14:04:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,764 INFO L225 Difference]: With dead ends: 243 [2021-12-15 14:04:28,765 INFO L226 Difference]: Without dead ends: 243 [2021-12-15 14:04:28,765 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-15 14:04:28,766 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 234 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 273 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-15 14:04:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2021-12-15 14:04:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 208 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2021-12-15 14:04:28,783 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 22 [2021-12-15 14:04:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,783 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2021-12-15 14:04:28,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2021-12-15 14:04:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:28,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:04:28,785 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2021-12-15 14:04:28,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803672147] [2021-12-15 14:04:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,841 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-15 14:04:28,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803672147] [2021-12-15 14:04:28,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803672147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:28,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564429553] [2021-12-15 14:04:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:28,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:28,845 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,018 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-12-15 14:04:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:29,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-12-15 14:04:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,020 INFO L225 Difference]: With dead ends: 208 [2021-12-15 14:04:29,020 INFO L226 Difference]: Without dead ends: 208 [2021-12-15 14:04:29,020 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-15 14:04:29,021 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 9 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 469 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-15 14:04:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-12-15 14:04:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.50625) internal successors, (241), 207 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2021-12-15 14:04:29,026 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 23 [2021-12-15 14:04:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,027 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2021-12-15 14:04:29,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2021-12-15 14:04:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:29,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:29,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:04:29,028 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2021-12-15 14:04:29,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670969474] [2021-12-15 14:04:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,075 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-15 14:04:29,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670969474] [2021-12-15 14:04:29,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670969474] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:29,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612803503] [2021-12-15 14:04:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:29,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:29,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:29,077 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,400 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2021-12-15 14:04:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-12-15 14:04:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,402 INFO L225 Difference]: With dead ends: 207 [2021-12-15 14:04:29,402 INFO L226 Difference]: Without dead ends: 207 [2021-12-15 14:04:29,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:29,404 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 458 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-15 14:04:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-12-15 14:04:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.49375) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2021-12-15 14:04:29,409 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 23 [2021-12-15 14:04:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,410 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2021-12-15 14:04:29,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2021-12-15 14:04:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:04:29,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:29,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:04:29,411 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2021-12-15 14:04:29,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957031964] [2021-12-15 14:04:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,509 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-15 14:04:29,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957031964] [2021-12-15 14:04:29,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957031964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:29,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27523319] [2021-12-15 14:04:29,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:29,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:29,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:29,511 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,862 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2021-12-15 14:04:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:29,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:04:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,864 INFO L225 Difference]: With dead ends: 206 [2021-12-15 14:04:29,864 INFO L226 Difference]: Without dead ends: 206 [2021-12-15 14:04:29,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:04:29,865 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 250 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 434 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-15 14:04:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-12-15 14:04:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.4875) internal successors, (238), 205 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2021-12-15 14:04:29,868 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 27 [2021-12-15 14:04:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,869 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2021-12-15 14:04:29,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2021-12-15 14:04:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:04:29,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:29,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 14:04:29,870 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2021-12-15 14:04:29,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897845725] [2021-12-15 14:04:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,980 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-15 14:04:29,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897845725] [2021-12-15 14:04:29,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897845725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:29,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807605189] [2021-12-15 14:04:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:29,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:29,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:29,983 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,382 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2021-12-15 14:04:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 14:04:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:04:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,383 INFO L225 Difference]: With dead ends: 198 [2021-12-15 14:04:30,384 INFO L226 Difference]: Without dead ends: 198 [2021-12-15 14:04:30,384 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-15 14:04:30,384 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 265 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 413 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-15 14:04:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2021-12-15 14:04:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 187 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 219 transitions. [2021-12-15 14:04:30,387 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 219 transitions. Word has length 27 [2021-12-15 14:04:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,387 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 219 transitions. [2021-12-15 14:04:30,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2021-12-15 14:04:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 14:04:30,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:30,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 14:04:30,388 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2021-12-15 14:04:30,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138277527] [2021-12-15 14:04:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,406 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-15 14:04:30,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138277527] [2021-12-15 14:04:30,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138277527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:30,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959679678] [2021-12-15 14:04:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:30,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:30,409 INFO L87 Difference]: Start difference. First operand 188 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,415 INFO L93 Difference]: Finished difference Result 262 states and 307 transitions. [2021-12-15 14:04:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:30,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 14:04:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,416 INFO L225 Difference]: With dead ends: 262 [2021-12-15 14:04:30,416 INFO L226 Difference]: Without dead ends: 262 [2021-12-15 14:04:30,417 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-15 14:04:30,417 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 52 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-15 14:04:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 194. [2021-12-15 14:04:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 193 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2021-12-15 14:04:30,421 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 28 [2021-12-15 14:04:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,421 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2021-12-15 14:04:30,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2021-12-15 14:04:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:04:30,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:30,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 14:04:30,423 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2021-12-15 14:04:30,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27978138] [2021-12-15 14:04:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,461 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-15 14:04:30,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27978138] [2021-12-15 14:04:30,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27978138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:30,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673200176] [2021-12-15 14:04:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:30,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:30,463 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,539 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2021-12-15 14:04:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 14:04:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,541 INFO L225 Difference]: With dead ends: 199 [2021-12-15 14:04:30,541 INFO L226 Difference]: Without dead ends: 199 [2021-12-15 14:04:30,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:30,542 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 228 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 131 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-15 14:04:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 190. [2021-12-15 14:04:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 189 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2021-12-15 14:04:30,545 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 29 [2021-12-15 14:04:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,545 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2021-12-15 14:04:30,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2021-12-15 14:04:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:04:30,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:30,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 14:04:30,547 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:30,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2021-12-15 14:04:30,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099620129] [2021-12-15 14:04:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,569 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-15 14:04:30,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099620129] [2021-12-15 14:04:30,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099620129] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:30,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170095783] [2021-12-15 14:04:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:30,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:30,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:30,571 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,582 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2021-12-15 14:04:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 14:04:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,583 INFO L225 Difference]: With dead ends: 188 [2021-12-15 14:04:30,584 INFO L226 Difference]: Without dead ends: 188 [2021-12-15 14:04:30,584 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-15 14:04:30,584 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-15 14:04:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-15 14:04:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 187 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2021-12-15 14:04:30,587 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 29 [2021-12-15 14:04:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,587 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2021-12-15 14:04:30,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2021-12-15 14:04:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 14:04:30,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:30,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 14:04:30,588 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,589 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2021-12-15 14:04:30,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525095261] [2021-12-15 14:04:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:30,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525095261] [2021-12-15 14:04:30,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525095261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:30,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311827804] [2021-12-15 14:04:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:30,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:30,656 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,928 INFO L93 Difference]: Finished difference Result 297 states and 337 transitions. [2021-12-15 14:04:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:04:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-12-15 14:04:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,929 INFO L225 Difference]: With dead ends: 297 [2021-12-15 14:04:30,929 INFO L226 Difference]: Without dead ends: 297 [2021-12-15 14:04:30,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:30,930 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 222 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 802 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-15 14:04:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 200. [2021-12-15 14:04:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 199 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2021-12-15 14:04:30,933 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 30 [2021-12-15 14:04:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,933 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2021-12-15 14:04:30,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2021-12-15 14:04:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 14:04:30,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,934 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:30,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-15 14:04:30,934 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2021-12-15 14:04:30,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681457277] [2021-12-15 14:04:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:30,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681457277] [2021-12-15 14:04:30,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681457277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:30,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980144115] [2021-12-15 14:04:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:30,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:31,007 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-15 14:04:31,008 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-15 14:04:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-15 14:04:31,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:31,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:31,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:31,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:31,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:31,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:31,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:31,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:31,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:04:31,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:31,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:31,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-15 14:04:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:32,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-15 14:04:32,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-15 14:04:32,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2021-12-15 14:04:32,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-15 14:04:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980144115] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:32,221 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:32,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-15 14:04:32,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546806960] [2021-12-15 14:04:32,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:32,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:04:32,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:04:32,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:32,223 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:32,579 INFO L93 Difference]: Finished difference Result 294 states and 323 transitions. [2021-12-15 14:04:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 14:04:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:32,582 INFO L225 Difference]: With dead ends: 294 [2021-12-15 14:04:32,582 INFO L226 Difference]: Without dead ends: 294 [2021-12-15 14:04:32,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:04:32,583 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 409 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:32,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 809 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 371 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2021-12-15 14:04:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-15 14:04:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 228. [2021-12-15 14:04:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.405128205128205) internal successors, (274), 227 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2021-12-15 14:04:32,587 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 32 [2021-12-15 14:04:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:32,587 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2021-12-15 14:04:32,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2021-12-15 14:04:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 14:04:32,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:32,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:32,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 14:04:32,812 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,SelfDestructingSolverStorable21 [2021-12-15 14:04:32,812 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2021-12-15 14:04:32,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:32,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410652749] [2021-12-15 14:04:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:32,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:32,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410652749] [2021-12-15 14:04:32,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410652749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:32,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:32,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 14:04:32,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293997919] [2021-12-15 14:04:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:32,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 14:04:32,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:32,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 14:04:32,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:04:32,909 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-15 14:04:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:33,283 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2021-12-15 14:04:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:04:33,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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 35 [2021-12-15 14:04:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:33,284 INFO L225 Difference]: With dead ends: 334 [2021-12-15 14:04:33,284 INFO L226 Difference]: Without dead ends: 334 [2021-12-15 14:04:33,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-12-15 14:04:33,285 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 499 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:33,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 769 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-15 14:04:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 229. [2021-12-15 14:04:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2021-12-15 14:04:33,288 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 35 [2021-12-15 14:04:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:33,288 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2021-12-15 14:04:33,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-15 14:04:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2021-12-15 14:04:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 14:04:33,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:33,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:33,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-15 14:04:33,289 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2021-12-15 14:04:33,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:33,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799523664] [2021-12-15 14:04:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:33,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:33,463 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-15 14:04:33,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:33,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799523664] [2021-12-15 14:04:33,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799523664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:33,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:33,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 14:04:33,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483176877] [2021-12-15 14:04:33,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:33,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:04:33,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:33,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:04:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:33,465 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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-15 14:04:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:34,109 INFO L93 Difference]: Finished difference Result 411 states and 441 transitions. [2021-12-15 14:04:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 14:04:34,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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 35 [2021-12-15 14:04:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:34,111 INFO L225 Difference]: With dead ends: 411 [2021-12-15 14:04:34,111 INFO L226 Difference]: Without dead ends: 411 [2021-12-15 14:04:34,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2021-12-15 14:04:34,111 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 458 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:34,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 1022 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 14:04:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-12-15 14:04:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 235. [2021-12-15 14:04:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 234 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2021-12-15 14:04:34,115 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 35 [2021-12-15 14:04:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:34,115 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2021-12-15 14:04:34,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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-15 14:04:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2021-12-15 14:04:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 14:04:34,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:34,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:34,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-15 14:04:34,116 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2021-12-15 14:04:34,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:34,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188588635] [2021-12-15 14:04:34,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:34,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:34,415 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-15 14:04:34,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:34,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188588635] [2021-12-15 14:04:34,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188588635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:34,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:34,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-15 14:04:34,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409441176] [2021-12-15 14:04:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:34,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 14:04:34,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 14:04:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:34,418 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:35,473 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2021-12-15 14:04:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 14:04:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-12-15 14:04:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:35,476 INFO L225 Difference]: With dead ends: 331 [2021-12-15 14:04:35,476 INFO L226 Difference]: Without dead ends: 331 [2021-12-15 14:04:35,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=944, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 14:04:35,477 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 566 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:35,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 947 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 14:04:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-12-15 14:04:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 235. [2021-12-15 14:04:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 234 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-15 14:04:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2021-12-15 14:04:35,481 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 37 [2021-12-15 14:04:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:35,481 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2021-12-15 14:04:35,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2021-12-15 14:04:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 14:04:35,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:35,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:35,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-15 14:04:35,482 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2021-12-15 14:04:35,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:35,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183895273] [2021-12-15 14:04:35,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:35,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:35,516 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-15 14:04:35,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:35,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183895273] [2021-12-15 14:04:35,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183895273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:35,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:35,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:35,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748243213] [2021-12-15 14:04:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:35,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:35,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:35,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:35,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:35,519 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:35,611 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2021-12-15 14:04:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-12-15 14:04:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:35,612 INFO L225 Difference]: With dead ends: 234 [2021-12-15 14:04:35,613 INFO L226 Difference]: Without dead ends: 234 [2021-12-15 14:04:35,613 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-15 14:04:35,613 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:35,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 418 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-15 14:04:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-12-15 14:04:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.357843137254902) internal successors, (277), 233 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-15 14:04:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 277 transitions. [2021-12-15 14:04:35,619 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 277 transitions. Word has length 37 [2021-12-15 14:04:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:35,619 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 277 transitions. [2021-12-15 14:04:35,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 277 transitions. [2021-12-15 14:04:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 14:04:35,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:35,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:35,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-15 14:04:35,621 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2021-12-15 14:04:35,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:35,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671128606] [2021-12-15 14:04:35,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:35,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:35,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:35,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671128606] [2021-12-15 14:04:35,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671128606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:35,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:35,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:35,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165627878] [2021-12-15 14:04:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:35,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:35,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:35,677 INFO L87 Difference]: Start difference. First operand 234 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:35,802 INFO L93 Difference]: Finished difference Result 233 states and 276 transitions. [2021-12-15 14:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:35,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-12-15 14:04:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:35,803 INFO L225 Difference]: With dead ends: 233 [2021-12-15 14:04:35,803 INFO L226 Difference]: Without dead ends: 233 [2021-12-15 14:04:35,804 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-15 14:04:35,804 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:35,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 412 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-15 14:04:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-12-15 14:04:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 232 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-15 14:04:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2021-12-15 14:04:35,808 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 37 [2021-12-15 14:04:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:35,808 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2021-12-15 14:04:35,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2021-12-15 14:04:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 14:04:35,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:35,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:35,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-15 14:04:35,809 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2021-12-15 14:04:35,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:35,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117238174] [2021-12-15 14:04:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:35,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:35,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:35,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117238174] [2021-12-15 14:04:35,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117238174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:35,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:35,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:35,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769354134] [2021-12-15 14:04:35,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:35,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:35,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:35,878 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:36,099 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2021-12-15 14:04:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-12-15 14:04:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:36,101 INFO L225 Difference]: With dead ends: 256 [2021-12-15 14:04:36,101 INFO L226 Difference]: Without dead ends: 256 [2021-12-15 14:04:36,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:04:36,101 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 52 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:36,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 628 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-15 14:04:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2021-12-15 14:04:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 241 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-15 14:04:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 285 transitions. [2021-12-15 14:04:36,106 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 285 transitions. Word has length 37 [2021-12-15 14:04:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:36,106 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 285 transitions. [2021-12-15 14:04:36,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 285 transitions. [2021-12-15 14:04:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 14:04:36,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:36,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:36,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-15 14:04:36,108 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2021-12-15 14:04:36,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:36,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266250592] [2021-12-15 14:04:36,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:36,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:36,138 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-15 14:04:36,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:36,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266250592] [2021-12-15 14:04:36,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266250592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:36,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:36,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:36,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556705613] [2021-12-15 14:04:36,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:36,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:36,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:36,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:36,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:36,141 INFO L87 Difference]: Start difference. First operand 242 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-15 14:04:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:36,147 INFO L93 Difference]: Finished difference Result 243 states and 286 transitions. [2021-12-15 14:04:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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 39 [2021-12-15 14:04:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:36,149 INFO L225 Difference]: With dead ends: 243 [2021-12-15 14:04:36,149 INFO L226 Difference]: Without dead ends: 243 [2021-12-15 14:04:36,150 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-15 14:04:36,150 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 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-15 14:04:36,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-15 14:04:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-12-15 14:04:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 242 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-15 14:04:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 286 transitions. [2021-12-15 14:04:36,155 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 286 transitions. Word has length 39 [2021-12-15 14:04:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:36,155 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 286 transitions. [2021-12-15 14:04:36,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-15 14:04:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 286 transitions. [2021-12-15 14:04:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 14:04:36,156 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:36,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:36,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-15 14:04:36,157 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash -404838824, now seen corresponding path program 1 times [2021-12-15 14:04:36,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172300265] [2021-12-15 14:04:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:36,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:36,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:36,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172300265] [2021-12-15 14:04:36,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172300265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:36,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:36,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:36,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131975568] [2021-12-15 14:04:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:36,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:36,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:36,191 INFO L87 Difference]: Start difference. First operand 243 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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-15 14:04:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:36,222 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2021-12-15 14:04:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:36,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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 39 [2021-12-15 14:04:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:36,223 INFO L225 Difference]: With dead ends: 256 [2021-12-15 14:04:36,224 INFO L226 Difference]: Without dead ends: 256 [2021-12-15 14:04:36,224 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-15 14:04:36,224 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:36,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 152 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-15 14:04:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2021-12-15 14:04:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 243 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 287 transitions. [2021-12-15 14:04:36,230 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 287 transitions. Word has length 39 [2021-12-15 14:04:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:36,230 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 287 transitions. [2021-12-15 14:04:36,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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-15 14:04:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 287 transitions. [2021-12-15 14:04:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:04:36,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:36,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:36,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-15 14:04:36,231 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:36,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2021-12-15 14:04:36,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:36,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344894258] [2021-12-15 14:04:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:36,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:36,459 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-15 14:04:36,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344894258] [2021-12-15 14:04:36,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344894258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:36,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:36,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-15 14:04:36,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957685209] [2021-12-15 14:04:36,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:36,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 14:04:36,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:36,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 14:04:36,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:36,461 INFO L87 Difference]: Start difference. First operand 244 states and 287 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:37,305 INFO L93 Difference]: Finished difference Result 412 states and 442 transitions. [2021-12-15 14:04:37,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 14:04:37,306 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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-15 14:04:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:37,308 INFO L225 Difference]: With dead ends: 412 [2021-12-15 14:04:37,308 INFO L226 Difference]: Without dead ends: 412 [2021-12-15 14:04:37,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2021-12-15 14:04:37,309 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 468 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:37,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 1294 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 14:04:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-12-15 14:04:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 244. [2021-12-15 14:04:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.330232558139535) internal successors, (286), 243 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-15 14:04:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2021-12-15 14:04:37,313 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 40 [2021-12-15 14:04:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:37,313 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2021-12-15 14:04:37,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2021-12-15 14:04:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:04:37,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:37,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:37,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-15 14:04:37,314 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:37,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553849, now seen corresponding path program 1 times [2021-12-15 14:04:37,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:37,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248560680] [2021-12-15 14:04:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:37,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:37,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:37,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248560680] [2021-12-15 14:04:37,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248560680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:37,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:37,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-15 14:04:37,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678553229] [2021-12-15 14:04:37,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:37,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 14:04:37,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 14:04:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:37,464 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:37,913 INFO L93 Difference]: Finished difference Result 243 states and 285 transitions. [2021-12-15 14:04:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 14:04:37,914 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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-15 14:04:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:37,915 INFO L225 Difference]: With dead ends: 243 [2021-12-15 14:04:37,915 INFO L226 Difference]: Without dead ends: 243 [2021-12-15 14:04:37,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-12-15 14:04:37,915 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 201 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:37,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 766 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-15 14:04:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-12-15 14:04:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3255813953488371) internal successors, (285), 242 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-15 14:04:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2021-12-15 14:04:37,919 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 40 [2021-12-15 14:04:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:37,919 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 285 transitions. [2021-12-15 14:04:37,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 285 transitions. [2021-12-15 14:04:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:04:37,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:37,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:37,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-15 14:04:37,920 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553848, now seen corresponding path program 1 times [2021-12-15 14:04:37,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:37,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843586345] [2021-12-15 14:04:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:37,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:38,014 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-15 14:04:38,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:38,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843586345] [2021-12-15 14:04:38,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843586345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:38,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:38,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:38,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079723943] [2021-12-15 14:04:38,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:38,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:38,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:38,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:38,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:38,016 INFO L87 Difference]: Start difference. First operand 243 states and 285 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:38,219 INFO L93 Difference]: Finished difference Result 243 states and 285 transitions. [2021-12-15 14:04:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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-15 14:04:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:38,220 INFO L225 Difference]: With dead ends: 243 [2021-12-15 14:04:38,220 INFO L226 Difference]: Without dead ends: 243 [2021-12-15 14:04:38,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:38,221 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:38,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 394 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-15 14:04:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2021-12-15 14:04:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 241 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-15 14:04:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2021-12-15 14:04:38,224 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 40 [2021-12-15 14:04:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:38,224 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2021-12-15 14:04:38,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2021-12-15 14:04:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 14:04:38,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:38,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:38,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-15 14:04:38,225 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1626494914, now seen corresponding path program 1 times [2021-12-15 14:04:38,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:38,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723992530] [2021-12-15 14:04:38,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:38,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:38,284 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-15 14:04:38,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:38,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723992530] [2021-12-15 14:04:38,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723992530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:38,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:38,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:38,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202792165] [2021-12-15 14:04:38,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:38,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:38,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:38,286 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:38,445 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2021-12-15 14:04:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-12-15 14:04:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:38,446 INFO L225 Difference]: With dead ends: 252 [2021-12-15 14:04:38,446 INFO L226 Difference]: Without dead ends: 252 [2021-12-15 14:04:38,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:04:38,446 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 33 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:38,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 449 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-15 14:04:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2021-12-15 14:04:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.3192488262910798) internal successors, (281), 238 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-15 14:04:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2021-12-15 14:04:38,450 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 41 [2021-12-15 14:04:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:38,450 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2021-12-15 14:04:38,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2021-12-15 14:04:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:04:38,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:38,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:38,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-15 14:04:38,451 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1357177023, now seen corresponding path program 1 times [2021-12-15 14:04:38,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:38,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612720312] [2021-12-15 14:04:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:38,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:38,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:38,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612720312] [2021-12-15 14:04:38,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612720312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:38,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:38,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:38,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127973891] [2021-12-15 14:04:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:38,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:38,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:38,478 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:38,520 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2021-12-15 14:04:38,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:38,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-12-15 14:04:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:38,521 INFO L225 Difference]: With dead ends: 249 [2021-12-15 14:04:38,521 INFO L226 Difference]: Without dead ends: 249 [2021-12-15 14:04:38,522 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-15 14:04:38,522 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 91 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:38,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 170 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-15 14:04:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 237. [2021-12-15 14:04:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 236 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-15 14:04:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2021-12-15 14:04:38,526 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 42 [2021-12-15 14:04:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:38,527 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2021-12-15 14:04:38,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2021-12-15 14:04:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:04:38,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:38,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, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:38,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-15 14:04:38,528 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash -284774687, now seen corresponding path program 1 times [2021-12-15 14:04:38,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:38,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595567622] [2021-12-15 14:04:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:38,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:38,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:38,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595567622] [2021-12-15 14:04:38,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595567622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:38,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918811462] [2021-12-15 14:04:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:38,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:38,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:38,634 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-15 14:04:38,636 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-15 14:04:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:38,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 14:04:38,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:38,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:38,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:38,761 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-15 14:04:38,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:38,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:38,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:38,796 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-15 14:04:38,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:38,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:38,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:04:38,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:04:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:38,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:39,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918811462] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:39,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:39,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-15 14:04:39,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946770569] [2021-12-15 14:04:39,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:39,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:39,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:39,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:39,093 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:39,313 INFO L93 Difference]: Finished difference Result 290 states and 324 transitions. [2021-12-15 14:04:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:39,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 42 [2021-12-15 14:04:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:39,315 INFO L225 Difference]: With dead ends: 290 [2021-12-15 14:04:39,315 INFO L226 Difference]: Without dead ends: 290 [2021-12-15 14:04:39,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:04:39,315 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 75 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:39,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 547 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-15 14:04:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259. [2021-12-15 14:04:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 258 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2021-12-15 14:04:39,320 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 42 [2021-12-15 14:04:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:39,320 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2021-12-15 14:04:39,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2021-12-15 14:04:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 14:04:39,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:39,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 14:04:39,342 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-15 14:04:39,531 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,SelfDestructingSolverStorable35 [2021-12-15 14:04:39,531 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -877180804, now seen corresponding path program 1 times [2021-12-15 14:04:39,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:39,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751482598] [2021-12-15 14:04:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:39,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:39,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:39,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751482598] [2021-12-15 14:04:39,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751482598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:39,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:39,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:39,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995830808] [2021-12-15 14:04:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:39,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:39,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:39,617 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:39,883 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2021-12-15 14:04:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:39,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-12-15 14:04:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:39,884 INFO L225 Difference]: With dead ends: 306 [2021-12-15 14:04:39,884 INFO L226 Difference]: Without dead ends: 306 [2021-12-15 14:04:39,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:04:39,885 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 411 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:39,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 469 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-15 14:04:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2021-12-15 14:04:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 258 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 308 transitions. [2021-12-15 14:04:39,887 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 308 transitions. Word has length 43 [2021-12-15 14:04:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:39,888 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 308 transitions. [2021-12-15 14:04:39,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 308 transitions. [2021-12-15 14:04:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 14:04:39,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:39,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:39,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-15 14:04:39,889 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash -877180803, now seen corresponding path program 1 times [2021-12-15 14:04:39,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:39,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979995618] [2021-12-15 14:04:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:39,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:40,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979995618] [2021-12-15 14:04:40,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979995618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:40,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:40,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:40,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342094317] [2021-12-15 14:04:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:40,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:40,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:40,025 INFO L87 Difference]: Start difference. First operand 259 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:40,429 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2021-12-15 14:04:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:04:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-12-15 14:04:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:40,430 INFO L225 Difference]: With dead ends: 306 [2021-12-15 14:04:40,430 INFO L226 Difference]: Without dead ends: 306 [2021-12-15 14:04:40,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:04:40,431 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 251 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:40,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 643 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-15 14:04:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2021-12-15 14:04:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 258 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 305 transitions. [2021-12-15 14:04:40,434 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 305 transitions. Word has length 43 [2021-12-15 14:04:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:40,434 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 305 transitions. [2021-12-15 14:04:40,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2021-12-15 14:04:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 14:04:40,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:40,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:40,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-15 14:04:40,435 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash -238079422, now seen corresponding path program 1 times [2021-12-15 14:04:40,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:40,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145659391] [2021-12-15 14:04:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:40,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:40,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145659391] [2021-12-15 14:04:40,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145659391] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700716187] [2021-12-15 14:04:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:40,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:40,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:40,496 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-15 14:04:40,522 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-15 14:04:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:40,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 14:04:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:40,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-15 14:04:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:40,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:04:40,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700716187] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:40,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:40,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-15 14:04:40,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769196887] [2021-12-15 14:04:40,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:40,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:40,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:40,972 INFO L87 Difference]: Start difference. First operand 259 states and 305 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:41,052 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2021-12-15 14:04:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:41,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-15 14:04:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:41,053 INFO L225 Difference]: With dead ends: 290 [2021-12-15 14:04:41,053 INFO L226 Difference]: Without dead ends: 266 [2021-12-15 14:04:41,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:41,054 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:41,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2021-12-15 14:04:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-15 14:04:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-12-15 14:04:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 241 states have (on average 1.2946058091286308) internal successors, (312), 265 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 312 transitions. [2021-12-15 14:04:41,057 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 312 transitions. Word has length 43 [2021-12-15 14:04:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:41,057 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 312 transitions. [2021-12-15 14:04:41,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 312 transitions. [2021-12-15 14:04:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 14:04:41,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:41,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:41,090 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-15 14:04:41,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:41,267 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1157151236, now seen corresponding path program 1 times [2021-12-15 14:04:41,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:41,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936204631] [2021-12-15 14:04:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:41,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:41,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:41,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936204631] [2021-12-15 14:04:41,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936204631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:41,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:41,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:41,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672119413] [2021-12-15 14:04:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:41,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:41,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:41,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:41,441 INFO L87 Difference]: Start difference. First operand 266 states and 312 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:41,719 INFO L93 Difference]: Finished difference Result 291 states and 325 transitions. [2021-12-15 14:04:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:04:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-12-15 14:04:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:41,721 INFO L225 Difference]: With dead ends: 291 [2021-12-15 14:04:41,721 INFO L226 Difference]: Without dead ends: 291 [2021-12-15 14:04:41,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:41,721 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 140 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:41,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 553 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-12-15 14:04:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 265. [2021-12-15 14:04:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 240 states have (on average 1.2916666666666667) internal successors, (310), 264 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2021-12-15 14:04:41,725 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 45 [2021-12-15 14:04:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:41,725 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2021-12-15 14:04:41,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2021-12-15 14:04:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 14:04:41,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:41,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:41,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-15 14:04:41,726 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1529922318, now seen corresponding path program 1 times [2021-12-15 14:04:41,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:41,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894125364] [2021-12-15 14:04:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:41,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:41,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:41,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894125364] [2021-12-15 14:04:41,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894125364] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:41,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:41,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:41,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233147361] [2021-12-15 14:04:41,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:41,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:41,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:41,757 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:41,764 INFO L93 Difference]: Finished difference Result 405 states and 481 transitions. [2021-12-15 14:04:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:41,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-12-15 14:04:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:41,765 INFO L225 Difference]: With dead ends: 405 [2021-12-15 14:04:41,765 INFO L226 Difference]: Without dead ends: 405 [2021-12-15 14:04:41,766 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-15 14:04:41,766 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:41,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 313 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-12-15 14:04:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 302. [2021-12-15 14:04:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 301 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 368 transitions. [2021-12-15 14:04:41,771 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 368 transitions. Word has length 45 [2021-12-15 14:04:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:41,771 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 368 transitions. [2021-12-15 14:04:41,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 368 transitions. [2021-12-15 14:04:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 14:04:41,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:41,772 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:41,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-15 14:04:41,773 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1376244065, now seen corresponding path program 1 times [2021-12-15 14:04:41,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:41,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99992434] [2021-12-15 14:04:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:41,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:41,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99992434] [2021-12-15 14:04:41,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99992434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:41,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:41,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:04:41,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840681600] [2021-12-15 14:04:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:41,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:41,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:41,822 INFO L87 Difference]: Start difference. First operand 302 states and 368 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:41,907 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2021-12-15 14:04:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:41,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-15 14:04:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:41,909 INFO L225 Difference]: With dead ends: 249 [2021-12-15 14:04:41,909 INFO L226 Difference]: Without dead ends: 249 [2021-12-15 14:04:41,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:41,909 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 56 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:41,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-15 14:04:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-12-15 14:04:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 225 states have (on average 1.2444444444444445) internal successors, (280), 248 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2021-12-15 14:04:41,912 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 47 [2021-12-15 14:04:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:41,913 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2021-12-15 14:04:41,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2021-12-15 14:04:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-15 14:04:41,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:41,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:41,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-15 14:04:41,913 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1538447444, now seen corresponding path program 1 times [2021-12-15 14:04:41,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:41,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204777146] [2021-12-15 14:04:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:41,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:42,015 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-15 14:04:42,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:42,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204777146] [2021-12-15 14:04:42,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204777146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:42,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:42,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 14:04:42,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160566839] [2021-12-15 14:04:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:42,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:42,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:42,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:42,018 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:42,268 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2021-12-15 14:04:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-12-15 14:04:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:42,269 INFO L225 Difference]: With dead ends: 238 [2021-12-15 14:04:42,269 INFO L226 Difference]: Without dead ends: 238 [2021-12-15 14:04:42,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:04:42,271 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 230 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:42,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 621 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-15 14:04:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 226. [2021-12-15 14:04:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 202 states have (on average 1.2623762376237624) internal successors, (255), 225 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2021-12-15 14:04:42,274 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 50 [2021-12-15 14:04:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:42,276 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2021-12-15 14:04:42,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2021-12-15 14:04:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-15 14:04:42,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:42,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:42,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-15 14:04:42,277 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:42,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1188819543, now seen corresponding path program 1 times [2021-12-15 14:04:42,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:42,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40817665] [2021-12-15 14:04:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:42,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:42,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40817665] [2021-12-15 14:04:42,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40817665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:42,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:42,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:42,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234541028] [2021-12-15 14:04:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:42,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:42,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:42,329 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:42,404 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2021-12-15 14:04:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:42,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-12-15 14:04:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:42,405 INFO L225 Difference]: With dead ends: 240 [2021-12-15 14:04:42,405 INFO L226 Difference]: Without dead ends: 240 [2021-12-15 14:04:42,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:42,408 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 19 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:42,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 491 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-15 14:04:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2021-12-15 14:04:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 228 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-15 14:04:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2021-12-15 14:04:42,411 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 52 [2021-12-15 14:04:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:42,412 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2021-12-15 14:04:42,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2021-12-15 14:04:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-15 14:04:42,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:42,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:42,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-15 14:04:42,413 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 426433170, now seen corresponding path program 1 times [2021-12-15 14:04:42,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951799796] [2021-12-15 14:04:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:42,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:42,661 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-15 14:04:42,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951799796] [2021-12-15 14:04:42,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951799796] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130951506] [2021-12-15 14:04:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:42,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:42,663 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-15 14:04:42,664 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-15 14:04:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:42,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-15 14:04:42,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:42,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:42,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:04:42,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:04:42,931 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:04:42,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:04:42,968 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 14:04:42,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-12-15 14:04:42,980 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-15 14:04:42,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:43,071 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:43,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2021-12-15 14:04:43,076 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-12-15 14:04:43,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:43,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 14:04:43,237 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:43,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-12-15 14:04:43,560 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:43,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2021-12-15 14:04:43,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-12-15 14:04:44,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:44,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2021-12-15 14:04:44,267 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 14:04:44,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 14:04:44,534 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-15 14:04:44,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:44,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= 1 (select |c_#valid| .cse0)) (and (forall ((v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= 0 .cse0))))) is different from false [2021-12-15 14:04:44,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (= 0 .cse0) (forall ((v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (= 1 (select |c_#valid| .cse0))))) is different from false [2021-12-15 14:04:44,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= 1 (select |c_#valid| .cse0)) (and (= 0 .cse0) (forall ((v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))))) is different from false [2021-12-15 14:04:44,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (= 0 .cse0) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1479) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (= 1 (select |c_#valid| .cse0))))) is different from false [2021-12-15 14:04:44,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1478))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1479) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= 0 .cse1)) (= 1 (select |c_#valid| .cse1))))) is different from false [2021-12-15 14:04:45,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= 1 (select |c_#valid| .cse0)) (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= 0 .cse0))))) is different from false [2021-12-15 14:04:45,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= 1 (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8| 1) .cse0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|))) (and (= 0 .cse0) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))))) is different from false [2021-12-15 14:04:45,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (= 0 .cse0) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478) |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (= 1 (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8| 1) .cse0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)))))) is different from false [2021-12-15 14:04:45,810 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-15 14:04:45,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-15 14:04:45,823 INFO L354 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-15 14:04:45,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 116 [2021-12-15 14:04:45,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:45,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 618 treesize of output 542 [2021-12-15 14:04:45,839 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-15 14:04:45,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 712 treesize of output 684 [2021-12-15 14:04:45,849 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:45,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 684 treesize of output 642 [2021-12-15 14:04:45,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 642 treesize of output 610 [2021-12-15 14:04:45,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2021-12-15 14:04:45,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 201 [2021-12-15 14:04:52,351 WARN L227 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 18 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-15 14:04:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:04:52,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130951506] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:52,383 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:52,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40 [2021-12-15 14:04:52,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68002777] [2021-12-15 14:04:52,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:52,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-15 14:04:52,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-15 14:04:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=860, Unknown=8, NotChecked=536, Total=1560 [2021-12-15 14:04:52,385 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:54,530 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0) (= (select .cse1 .cse2) 0) (= (select .cse1 .cse0) 0) (= 1 .cse3) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc10#1.base|) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) (= .cse3 1) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= 1 (select |c_#valid| .cse4)) (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= 0 .cse4))))) (= 0 |c_ULTIMATE.start_main_#t~malloc10#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0) (< |c_ULTIMATE.start_main_~end~0#1.offset| (+ |c_ULTIMATE.start_main_~list~0#1.offset| 1)) (= (select .cse6 .cse2) 0) (= (select .cse6 .cse0) 0))) is different from false [2021-12-15 14:04:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:59,534 INFO L93 Difference]: Finished difference Result 352 states and 386 transitions. [2021-12-15 14:04:59,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 14:04:59,534 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 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 54 [2021-12-15 14:04:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:59,535 INFO L225 Difference]: With dead ends: 352 [2021-12-15 14:04:59,535 INFO L226 Difference]: Without dead ends: 352 [2021-12-15 14:04:59,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=344, Invalid=1936, Unknown=12, NotChecked=900, Total=3192 [2021-12-15 14:04:59,536 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 283 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1866 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:59,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 1398 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 722 Invalid, 0 Unknown, 1866 Unchecked, 0.4s Time] [2021-12-15 14:04:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-12-15 14:04:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 259. [2021-12-15 14:04:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.2340425531914894) internal successors, (290), 258 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2021-12-15 14:04:59,539 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 54 [2021-12-15 14:04:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:59,539 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2021-12-15 14:04:59,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2021-12-15 14:04:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-15 14:04:59,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:59,540 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:59,575 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-15 14:04:59,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:59,747 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:04:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851803, now seen corresponding path program 1 times [2021-12-15 14:04:59,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:59,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350252135] [2021-12-15 14:04:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:59,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:59,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350252135] [2021-12-15 14:04:59,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350252135] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94912648] [2021-12-15 14:04:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:59,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:00,004 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-15 14:05:00,005 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-15 14:05:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:00,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-15 14:05:00,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:00,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:00,324 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 14:05:00,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 14:05:00,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:00,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:05:00,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:00,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:00,526 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:05:00,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2021-12-15 14:05:01,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:01,331 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-15 14:05:01,331 INFO L388 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 54 [2021-12-15 14:05:01,358 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-15 14:05:01,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2021-12-15 14:05:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:01,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:06,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 177 [2021-12-15 14:05:06,978 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:06,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 106 [2021-12-15 14:05:08,207 INFO L354 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2021-12-15 14:05:08,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 246 [2021-12-15 14:05:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:08,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94912648] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:08,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:08,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2021-12-15 14:05:08,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50898529] [2021-12-15 14:05:08,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:08,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-15 14:05:08,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-15 14:05:08,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=806, Unknown=2, NotChecked=0, Total=930 [2021-12-15 14:05:08,673 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 31 states, 30 states have (on average 5.4) internal successors, (162), 31 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:17,421 INFO L93 Difference]: Finished difference Result 389 states and 427 transitions. [2021-12-15 14:05:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 14:05:17,424 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 5.4) internal successors, (162), 31 states have internal predecessors, (162), 0 states have call successors, (0), 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 56 [2021-12-15 14:05:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:17,425 INFO L225 Difference]: With dead ends: 389 [2021-12-15 14:05:17,425 INFO L226 Difference]: Without dead ends: 389 [2021-12-15 14:05:17,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=290, Invalid=1430, Unknown=2, NotChecked=0, Total=1722 [2021-12-15 14:05:17,426 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 584 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 761 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:17,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 1224 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 725 Invalid, 0 Unknown, 761 Unchecked, 0.4s Time] [2021-12-15 14:05:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-12-15 14:05:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 297. [2021-12-15 14:05:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.2197802197802199) internal successors, (333), 296 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 333 transitions. [2021-12-15 14:05:17,437 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 333 transitions. Word has length 56 [2021-12-15 14:05:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:17,438 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 333 transitions. [2021-12-15 14:05:17,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 5.4) internal successors, (162), 31 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 333 transitions. [2021-12-15 14:05:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-15 14:05:17,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:17,439 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:17,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:17,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-15 14:05:17,663 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:05:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851802, now seen corresponding path program 1 times [2021-12-15 14:05:17,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:17,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85313358] [2021-12-15 14:05:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:17,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:17,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85313358] [2021-12-15 14:05:17,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85313358] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804613768] [2021-12-15 14:05:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:17,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:17,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:17,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:05:17,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 14:05:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:17,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 14:05:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:18,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:18,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:18,094 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:18,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 14:05:18,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:18,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:18,239 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-15 14:05:18,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 14:05:18,366 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-15 14:05:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:18,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:05:18,481 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-15 14:05:18,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-15 14:05:18,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:18,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:05:18,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:18,694 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:18,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-15 14:05:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:18,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:19,858 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:19,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 105 [2021-12-15 14:05:19,862 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:19,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 81 [2021-12-15 14:05:19,869 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:19,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 390 treesize of output 353 [2021-12-15 14:05:19,879 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:19,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 917 treesize of output 884 [2021-12-15 14:05:19,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 853 treesize of output 821 [2021-12-15 14:05:19,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 821 treesize of output 789 [2021-12-15 14:05:19,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 789 treesize of output 773 [2021-12-15 14:05:19,937 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:19,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 773 treesize of output 726 [2021-12-15 14:05:19,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 717 treesize of output 709 [2021-12-15 14:05:19,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 709 treesize of output 701 [2021-12-15 14:05:19,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 701 treesize of output 697 [2021-12-15 14:05:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:20,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804613768] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:20,762 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:20,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2021-12-15 14:05:20,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041444255] [2021-12-15 14:05:20,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:20,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-15 14:05:20,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-15 14:05:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1120, Unknown=23, NotChecked=0, Total=1260 [2021-12-15 14:05:20,763 INFO L87 Difference]: Start difference. First operand 297 states and 333 transitions. Second operand has 36 states, 35 states have (on average 4.742857142857143) internal successors, (166), 36 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:22,568 INFO L93 Difference]: Finished difference Result 447 states and 480 transitions. [2021-12-15 14:05:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-15 14:05:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.742857142857143) internal successors, (166), 36 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-12-15 14:05:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:22,570 INFO L225 Difference]: With dead ends: 447 [2021-12-15 14:05:22,570 INFO L226 Difference]: Without dead ends: 447 [2021-12-15 14:05:22,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=515, Invalid=3244, Unknown=23, NotChecked=0, Total=3782 [2021-12-15 14:05:22,572 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 886 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:22,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 2177 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1701 Invalid, 0 Unknown, 853 Unchecked, 0.7s Time] [2021-12-15 14:05:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-12-15 14:05:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 314. [2021-12-15 14:05:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 290 states have (on average 1.2310344827586206) internal successors, (357), 313 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 357 transitions. [2021-12-15 14:05:22,578 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 357 transitions. Word has length 56 [2021-12-15 14:05:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:22,579 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 357 transitions. [2021-12-15 14:05:22,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.742857142857143) internal successors, (166), 36 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 357 transitions. [2021-12-15 14:05:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-15 14:05:22,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:22,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 14:05:22,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-15 14:05:22,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:22,807 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:05:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1627380482, now seen corresponding path program 1 times [2021-12-15 14:05:22,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:22,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267215152] [2021-12-15 14:05:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:22,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:22,971 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-15 14:05:22,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:22,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267215152] [2021-12-15 14:05:22,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267215152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:22,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:22,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-15 14:05:22,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701891105] [2021-12-15 14:05:22,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:22,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:05:22,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:05:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:05:22,973 INFO L87 Difference]: Start difference. First operand 314 states and 357 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:23,397 INFO L93 Difference]: Finished difference Result 334 states and 365 transitions. [2021-12-15 14:05:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 14:05:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-12-15 14:05:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:23,398 INFO L225 Difference]: With dead ends: 334 [2021-12-15 14:05:23,398 INFO L226 Difference]: Without dead ends: 334 [2021-12-15 14:05:23,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-12-15 14:05:23,399 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 419 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:23,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 657 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:05:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-15 14:05:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 314. [2021-12-15 14:05:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 290 states have (on average 1.2275862068965517) internal successors, (356), 313 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 356 transitions. [2021-12-15 14:05:23,402 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 356 transitions. Word has length 57 [2021-12-15 14:05:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:23,402 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 356 transitions. [2021-12-15 14:05:23,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 356 transitions. [2021-12-15 14:05:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-15 14:05:23,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:23,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:23,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-15 14:05:23,403 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-15 14:05:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1135767587, now seen corresponding path program 1 times [2021-12-15 14:05:23,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:23,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434462533] [2021-12-15 14:05:23,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:23,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:23,697 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-15 14:05:23,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:23,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434462533] [2021-12-15 14:05:23,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434462533] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:23,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047723660] [2021-12-15 14:05:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:23,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:23,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:23,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:05:23,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 14:05:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:23,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-15 14:05:23,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:23,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:23,924 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:05:23,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:05:23,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:05:24,029 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:24,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-15 14:05:24,077 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:24,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-15 14:05:24,208 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-15 14:05:24,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-15 14:05:24,277 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 14:05:24,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2021-12-15 14:05:24,460 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:24,460 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 48 [2021-12-15 14:05:24,762 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:24,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2021-12-15 14:05:25,397 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:25,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-15 14:05:26,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:26,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2021-12-15 14:05:29,360 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-15 14:05:29,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:29,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1853) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:29,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1853) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:29,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1853)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:29,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1853)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:29,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1853)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:29,497 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1853)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:29,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1853)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:29,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int) (v_ArrVal_1847 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1847))) (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1853)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:31,978 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:31,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 114 [2021-12-15 14:05:31,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:31,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 898 treesize of output 876 [2021-12-15 14:05:32,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 948 treesize of output 916 [2021-12-15 14:05:32,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 860 treesize of output 796 [2021-12-15 14:05:32,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 844 treesize of output 800 [2021-12-15 14:05:32,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 714