./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.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 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:40:40,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:40:40,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:40:40,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:40:40,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:40:40,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:40:40,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:40:40,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:40:40,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:40:40,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:40:40,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:40:40,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:40:40,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:40:40,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:40:40,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:40:40,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:40:40,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:40:40,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:40:40,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:40:40,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:40:40,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:40:40,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:40:40,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:40:40,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:40:40,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:40:40,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:40:40,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:40:40,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:40:40,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:40:40,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:40:40,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:40:40,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:40:40,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:40:40,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:40:40,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:40:40,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:40:40,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:40:40,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:40:40,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:40:40,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:40:40,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:40:40,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 16:40:40,447 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:40:40,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:40:40,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:40:40,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:40:40,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:40:40,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:40:40,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:40:40,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:40:40,450 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:40:40,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:40:40,451 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:40:40,451 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:40:40,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:40:40,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:40:40,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:40:40,452 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:40:40,452 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:40:40,452 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:40:40,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:40:40,452 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:40:40,452 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:40:40,452 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:40:40,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:40:40,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:40:40,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:40:40,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:40:40,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:40:40,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:40:40,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:40:40,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:40:40,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:40:40,455 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 -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2021-12-22 16:40:40,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:40:40,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:40:40,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:40:40,642 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:40:40,642 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:40:40,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-22 16:40:40,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857b47482/2338a3980797487d9fb1496a75f393f6/FLAG51dc49bd1 [2021-12-22 16:40:41,195 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:40:41,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-22 16:40:41,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857b47482/2338a3980797487d9fb1496a75f393f6/FLAG51dc49bd1 [2021-12-22 16:40:41,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857b47482/2338a3980797487d9fb1496a75f393f6 [2021-12-22 16:40:41,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:40:41,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:40:41,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:40:41,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:40:41,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:40:41,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:40:41" (1/1) ... [2021-12-22 16:40:41,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b038e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:41, skipping insertion in model container [2021-12-22 16:40:41,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:40:41" (1/1) ... [2021-12-22 16:40:41,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:40:41,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:40:41,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-22 16:40:41,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-22 16:40:41,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-22 16:40:41,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-22 16:40:41,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:40:41,960 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:40:41,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-22 16:40:42,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-22 16:40:42,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-22 16:40:42,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-22 16:40:42,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:40:42,026 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:40:42,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42 WrapperNode [2021-12-22 16:40:42,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:40:42,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:40:42,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:40:42,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:40:42,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,066 INFO L137 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2021-12-22 16:40:42,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:40:42,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:40:42,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:40:42,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:40:42,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:40:42,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:40:42,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:40:42,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:40:42,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (1/1) ... [2021-12-22 16:40:42,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:40:42,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:42,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:40:42,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 16:40:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:40:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:40:42,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:40:42,278 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:40:42,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:40:42,580 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:40:42,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:40:42,585 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-22 16:40:42,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:42 BoogieIcfgContainer [2021-12-22 16:40:42,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:40:42,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:40:42,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:40:42,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:40:42,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:40:41" (1/3) ... [2021-12-22 16:40:42,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fd8306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:40:42, skipping insertion in model container [2021-12-22 16:40:42,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:40:42" (2/3) ... [2021-12-22 16:40:42,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fd8306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:40:42, skipping insertion in model container [2021-12-22 16:40:42,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:40:42" (3/3) ... [2021-12-22 16:40:42,597 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2021-12-22 16:40:42,601 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:40:42,601 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-12-22 16:40:42,627 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:40:42,631 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:40:42,631 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-12-22 16:40:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:40:42,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:42,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:40:42,645 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:42,649 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:40:42,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521614510] [2021-12-22 16:40:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:42,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:42,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521614510] [2021-12-22 16:40:42,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521614510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:42,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:42,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:40:42,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926477711] [2021-12-22 16:40:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:42,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:40:42,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:40:42,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:42,809 INFO L87 Difference]: Start difference. First operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:42,930 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-22 16:40:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:40:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:40:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:42,939 INFO L225 Difference]: With dead ends: 123 [2021-12-22 16:40:42,939 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 16:40:42,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:42,943 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:42,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 75 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 16:40:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-22 16:40:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 114 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2021-12-22 16:40:42,979 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 3 [2021-12-22 16:40:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:42,979 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2021-12-22 16:40:42,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2021-12-22 16:40:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:40:42,980 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:42,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:40:42,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:40:42,981 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:40:42,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:42,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496056698] [2021-12-22 16:40:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:42,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496056698] [2021-12-22 16:40:43,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496056698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:40:43,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034076599] [2021-12-22 16:40:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:40:43,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:40:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:43,039 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,140 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-22 16:40:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:40:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:40:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,141 INFO L225 Difference]: With dead ends: 133 [2021-12-22 16:40:43,142 INFO L226 Difference]: Without dead ends: 133 [2021-12-22 16:40:43,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:43,143 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 80 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-22 16:40:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2021-12-22 16:40:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2021-12-22 16:40:43,149 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2021-12-22 16:40:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,150 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2021-12-22 16:40:43,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2021-12-22 16:40:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:40:43,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:40:43,151 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-22 16:40:43,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562497154] [2021-12-22 16:40:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562497154] [2021-12-22 16:40:43,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562497154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:40:43,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419879558] [2021-12-22 16:40:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:43,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:43,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:43,198 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,297 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-22 16:40:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:40:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 16:40:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,298 INFO L225 Difference]: With dead ends: 125 [2021-12-22 16:40:43,298 INFO L226 Difference]: Without dead ends: 125 [2021-12-22 16:40:43,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:43,299 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 158 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 63 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-22 16:40:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2021-12-22 16:40:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2021-12-22 16:40:43,305 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 8 [2021-12-22 16:40:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,305 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2021-12-22 16:40:43,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2021-12-22 16:40:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:40:43,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:40:43,307 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-22 16:40:43,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885581586] [2021-12-22 16:40:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885581586] [2021-12-22 16:40:43,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885581586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:43,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130765613] [2021-12-22 16:40:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:43,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:43,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:43,377 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,544 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2021-12-22 16:40:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:40:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 16:40:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,545 INFO L225 Difference]: With dead ends: 145 [2021-12-22 16:40:43,545 INFO L226 Difference]: Without dead ends: 145 [2021-12-22 16:40:43,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:40:43,546 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 249 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 102 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-22 16:40:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2021-12-22 16:40:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-12-22 16:40:43,551 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 8 [2021-12-22 16:40:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,552 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-12-22 16:40:43,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-12-22 16:40:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:40:43,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:40:43,553 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1117785369, now seen corresponding path program 1 times [2021-12-22 16:40:43,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497159135] [2021-12-22 16:40:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497159135] [2021-12-22 16:40:43,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497159135] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:40:43,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205676315] [2021-12-22 16:40:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:43,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:43,584 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,672 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2021-12-22 16:40:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:40:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 16:40:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,673 INFO L225 Difference]: With dead ends: 130 [2021-12-22 16:40:43,673 INFO L226 Difference]: Without dead ends: 130 [2021-12-22 16:40:43,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:43,678 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-22 16:40:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2021-12-22 16:40:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-22 16:40:43,690 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 10 [2021-12-22 16:40:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,691 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-22 16:40:43,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-22 16:40:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:40:43,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:40:43,692 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-22 16:40:43,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111954328] [2021-12-22 16:40:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111954328] [2021-12-22 16:40:43,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111954328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:43,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950507337] [2021-12-22 16:40:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:43,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:43,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:43,744 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:43,876 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2021-12-22 16:40:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:40:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 16:40:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:43,878 INFO L225 Difference]: With dead ends: 116 [2021-12-22 16:40:43,878 INFO L226 Difference]: Without dead ends: 116 [2021-12-22 16:40:43,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:40:43,879 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:43,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 249 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-22 16:40:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-12-22 16:40:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 114 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-12-22 16:40:43,882 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 12 [2021-12-22 16:40:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:43,882 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-12-22 16:40:43,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-12-22 16:40:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:40:43,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:43,883 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:43,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:40:43,883 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-22 16:40:43,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:43,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920048018] [2021-12-22 16:40:43,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:43,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:43,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:43,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920048018] [2021-12-22 16:40:43,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920048018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:43,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:43,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:43,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311502343] [2021-12-22 16:40:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:43,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:43,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:43,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:43,945 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:44,147 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-12-22 16:40:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:40:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 16:40:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:44,148 INFO L225 Difference]: With dead ends: 117 [2021-12-22 16:40:44,148 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 16:40:44,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:40:44,149 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:44,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 284 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 16:40:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2021-12-22 16:40:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 109 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-12-22 16:40:44,152 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 12 [2021-12-22 16:40:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:44,153 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-12-22 16:40:44,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-12-22 16:40:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:40:44,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:44,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:44,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:40:44,154 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1066467192, now seen corresponding path program 1 times [2021-12-22 16:40:44,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:44,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981664198] [2021-12-22 16:40:44,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:44,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:44,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:44,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981664198] [2021-12-22 16:40:44,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981664198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:44,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:44,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:40:44,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42734770] [2021-12-22 16:40:44,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:44,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:44,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:44,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:44,216 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:44,342 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2021-12-22 16:40:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:40:44,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 16:40:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:44,343 INFO L225 Difference]: With dead ends: 167 [2021-12-22 16:40:44,343 INFO L226 Difference]: Without dead ends: 167 [2021-12-22 16:40:44,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:40:44,344 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:44,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 227 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-22 16:40:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2021-12-22 16:40:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4) internal successors, (126), 116 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2021-12-22 16:40:44,347 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 13 [2021-12-22 16:40:44,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:44,348 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2021-12-22 16:40:44,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2021-12-22 16:40:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:40:44,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:44,349 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-22 16:40:44,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:40:44,349 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1434903386, now seen corresponding path program 1 times [2021-12-22 16:40:44,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:44,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52842401] [2021-12-22 16:40:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:44,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:44,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-22 16:40:44,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:44,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52842401] [2021-12-22 16:40:44,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52842401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:44,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:44,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:44,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840326174] [2021-12-22 16:40:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:44,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:40:44,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:44,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:40:44,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:44,417 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:44,499 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2021-12-22 16:40:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:40:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 16:40:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:44,500 INFO L225 Difference]: With dead ends: 121 [2021-12-22 16:40:44,500 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 16:40:44,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:44,501 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:44,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 16:40:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2021-12-22 16:40:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-22 16:40:44,503 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 20 [2021-12-22 16:40:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:44,503 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-22 16:40:44,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-22 16:40:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:40:44,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:44,504 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:44,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:40:44,505 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1476921639, now seen corresponding path program 1 times [2021-12-22 16:40:44,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:44,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5229928] [2021-12-22 16:40:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:44,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:44,559 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-22 16:40:44,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:44,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5229928] [2021-12-22 16:40:44,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5229928] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:44,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196307508] [2021-12-22 16:40:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:44,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:44,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:44,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:40:44,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 16:40:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:44,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-22 16:40:44,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:44,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:44,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:44,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:40:44,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:40:44,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:40:44,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:40:44,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:44,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:44,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:44,895 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:44,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-22 16:40:44,904 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-22 16:40:44,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:45,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-22 16:40:45,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-22 16:40:45,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2021-12-22 16:40:45,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-22 16:40:45,218 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-22 16:40:45,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196307508] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:45,219 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:45,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-22 16:40:45,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909376323] [2021-12-22 16:40:45,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:45,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:40:45,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:40:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:40:45,220 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-22 16:40:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:45,462 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-22 16:40:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 16:40:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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 20 [2021-12-22 16:40:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:45,463 INFO L225 Difference]: With dead ends: 143 [2021-12-22 16:40:45,463 INFO L226 Difference]: Without dead ends: 143 [2021-12-22 16:40:45,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:40:45,464 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 162 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:45,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 453 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2021-12-22 16:40:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-22 16:40:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2021-12-22 16:40:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2021-12-22 16:40:45,466 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2021-12-22 16:40:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:45,467 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2021-12-22 16:40:45,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-22 16:40:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2021-12-22 16:40:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:40:45,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:45,467 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] [2021-12-22 16:40:45,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:45,701 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,SelfDestructingSolverStorable9 [2021-12-22 16:40:45,702 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451530, now seen corresponding path program 1 times [2021-12-22 16:40:45,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:45,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484321315] [2021-12-22 16:40:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:45,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:45,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484321315] [2021-12-22 16:40:45,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484321315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:45,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:45,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:45,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822859159] [2021-12-22 16:40:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:45,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:45,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:45,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:45,774 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:45,889 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-12-22 16:40:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:40:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 16:40:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:45,891 INFO L225 Difference]: With dead ends: 123 [2021-12-22 16:40:45,891 INFO L226 Difference]: Without dead ends: 123 [2021-12-22 16:40:45,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:40:45,892 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:45,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 246 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-22 16:40:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2021-12-22 16:40:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 121 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2021-12-22 16:40:45,894 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 21 [2021-12-22 16:40:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:45,894 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2021-12-22 16:40:45,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2021-12-22 16:40:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:40:45,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:45,897 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] [2021-12-22 16:40:45,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:40:45,897 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451529, now seen corresponding path program 1 times [2021-12-22 16:40:45,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:45,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192432167] [2021-12-22 16:40:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:45,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:45,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:45,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192432167] [2021-12-22 16:40:45,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192432167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:45,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:45,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:40:45,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667487118] [2021-12-22 16:40:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:45,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:40:45,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:40:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:40:45,985 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:46,094 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2021-12-22 16:40:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:40:46,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 16:40:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:46,096 INFO L225 Difference]: With dead ends: 120 [2021-12-22 16:40:46,096 INFO L226 Difference]: Without dead ends: 120 [2021-12-22 16:40:46,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:40:46,097 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 9 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:46,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 292 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:40:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-22 16:40:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2021-12-22 16:40:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-22 16:40:46,101 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 21 [2021-12-22 16:40:46,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:46,101 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-22 16:40:46,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-22 16:40:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 16:40:46,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:46,103 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] [2021-12-22 16:40:46,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 16:40:46,103 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash -794042809, now seen corresponding path program 1 times [2021-12-22 16:40:46,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687120479] [2021-12-22 16:40:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:46,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:46,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:46,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687120479] [2021-12-22 16:40:46,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687120479] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:46,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891673309] [2021-12-22 16:40:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:46,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:46,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:46,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:40:46,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 16:40:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:46,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-22 16:40:46,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:46,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:40:46,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 16:40:46,448 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:40:46,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 16:40:46,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:40:46,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:40:46,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:46,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 16:40:46,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:46,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:46,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:46,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:46,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:46,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:46,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:46,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_316 Int)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_316)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:46,750 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_7| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_57| Int) (v_ArrVal_316 Int)) (or (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_57| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_7|) 0)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_57| v_ArrVal_316)) |v_ULTIMATE.start_main_#t~malloc3#1.base_7| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))))) is different from false [2021-12-22 16:40:46,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:46,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:46,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2021-12-22 16:40:46,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-22 16:40:46,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-22 16:40:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:46,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891673309] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:46,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:46,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2021-12-22 16:40:46,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124566747] [2021-12-22 16:40:46,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:46,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-22 16:40:46,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-22 16:40:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=302, Unknown=5, NotChecked=200, Total=600 [2021-12-22 16:40:46,788 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 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-22 16:40:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:47,253 INFO L93 Difference]: Finished difference Result 254 states and 271 transitions. [2021-12-22 16:40:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 16:40:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 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 23 [2021-12-22 16:40:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:47,256 INFO L225 Difference]: With dead ends: 254 [2021-12-22 16:40:47,256 INFO L226 Difference]: Without dead ends: 254 [2021-12-22 16:40:47,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=658, Unknown=5, NotChecked=300, Total=1190 [2021-12-22 16:40:47,257 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 331 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:47,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 534 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 596 Invalid, 0 Unknown, 682 Unchecked, 0.3s Time] [2021-12-22 16:40:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-22 16:40:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 128. [2021-12-22 16:40:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 127 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-12-22 16:40:47,259 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 23 [2021-12-22 16:40:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:47,259 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-12-22 16:40:47,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 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-22 16:40:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-12-22 16:40:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:40:47,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:47,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:47,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:47,471 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,SelfDestructingSolverStorable12 [2021-12-22 16:40:47,471 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash -136678670, now seen corresponding path program 1 times [2021-12-22 16:40:47,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:47,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599190935] [2021-12-22 16:40:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:47,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:47,502 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-22 16:40:47,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:47,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599190935] [2021-12-22 16:40:47,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599190935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:47,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:47,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:40:47,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772412536] [2021-12-22 16:40:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:47,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:40:47,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:47,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:40:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:47,505 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:47,530 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2021-12-22 16:40:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:40:47,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 16:40:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:47,531 INFO L225 Difference]: With dead ends: 130 [2021-12-22 16:40:47,531 INFO L226 Difference]: Without dead ends: 130 [2021-12-22 16:40:47,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:40:47,532 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:47,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:40:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-22 16:40:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-22 16:40:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.287037037037037) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2021-12-22 16:40:47,534 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 26 [2021-12-22 16:40:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:47,534 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2021-12-22 16:40:47,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2021-12-22 16:40:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 16:40:47,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:47,535 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-22 16:40:47,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:40:47,536 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:47,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1795791349, now seen corresponding path program 1 times [2021-12-22 16:40:47,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:47,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030848871] [2021-12-22 16:40:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:47,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:47,573 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-22 16:40:47,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:47,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030848871] [2021-12-22 16:40:47,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030848871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:40:47,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:40:47,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:40:47,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436461358] [2021-12-22 16:40:47,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:40:47,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:40:47,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:47,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:40:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:40:47,575 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-22 16:40:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:47,625 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2021-12-22 16:40:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:40:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-22 16:40:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:47,626 INFO L225 Difference]: With dead ends: 138 [2021-12-22 16:40:47,626 INFO L226 Difference]: Without dead ends: 138 [2021-12-22 16:40:47,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:47,627 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:47,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:40:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-22 16:40:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2021-12-22 16:40:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2021-12-22 16:40:47,629 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 28 [2021-12-22 16:40:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:47,630 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2021-12-22 16:40:47,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-22 16:40:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2021-12-22 16:40:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:40:47,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:47,630 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:47,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:40:47,631 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1776841875, now seen corresponding path program 1 times [2021-12-22 16:40:47,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:47,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287968711] [2021-12-22 16:40:47,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:47,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:47,736 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-22 16:40:47,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:47,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287968711] [2021-12-22 16:40:47,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287968711] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:47,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100249723] [2021-12-22 16:40:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:47,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:47,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:47,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:40:47,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 16:40:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:47,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-22 16:40:47,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:47,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:47,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:47,826 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:40:47,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:40:47,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:40:47,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:40:47,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:47,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:47,928 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-22 16:40:47,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:48,049 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-22 16:40:48,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100249723] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:48,050 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:48,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-22 16:40:48,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529717743] [2021-12-22 16:40:48,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:48,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:40:48,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:40:48,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:40:48,051 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:48,334 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2021-12-22 16:40:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 16:40:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 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-22 16:40:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:48,335 INFO L225 Difference]: With dead ends: 180 [2021-12-22 16:40:48,335 INFO L226 Difference]: Without dead ends: 180 [2021-12-22 16:40:48,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:40:48,336 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 78 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:48,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 387 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:40:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-22 16:40:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2021-12-22 16:40:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 143 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2021-12-22 16:40:48,338 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 29 [2021-12-22 16:40:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:48,338 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2021-12-22 16:40:48,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2021-12-22 16:40:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:40:48,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:48,339 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-22 16:40:48,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:48,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:48,545 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 752476291, now seen corresponding path program 1 times [2021-12-22 16:40:48,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:48,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580275064] [2021-12-22 16:40:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:48,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:48,570 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-22 16:40:48,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:48,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580275064] [2021-12-22 16:40:48,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580275064] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:48,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133101193] [2021-12-22 16:40:48,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:48,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:48,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:48,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:40:48,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 16:40:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:48,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 16:40:48,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:48,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 16:40:48,779 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-22 16:40:48,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:48,830 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-22 16:40:48,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133101193] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:48,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:48,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-22 16:40:48,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47047089] [2021-12-22 16:40:48,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:48,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:40:48,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:48,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:40:48,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:48,831 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:48,875 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2021-12-22 16:40:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:40:48,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-22 16:40:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:48,876 INFO L225 Difference]: With dead ends: 152 [2021-12-22 16:40:48,876 INFO L226 Difference]: Without dead ends: 129 [2021-12-22 16:40:48,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:40:48,876 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:48,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2021-12-22 16:40:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-22 16:40:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-22 16:40:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2021-12-22 16:40:48,879 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 30 [2021-12-22 16:40:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:48,879 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2021-12-22 16:40:48,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2021-12-22 16:40:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:40:48,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:48,880 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] [2021-12-22 16:40:48,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:49,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-22 16:40:49,097 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230200, now seen corresponding path program 1 times [2021-12-22 16:40:49,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:49,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634097132] [2021-12-22 16:40:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:49,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:49,220 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-22 16:40:49,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634097132] [2021-12-22 16:40:49,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634097132] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630601714] [2021-12-22 16:40:49,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:49,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:49,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:49,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:40:49,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 16:40:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:49,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-22 16:40:49,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:49,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:40:49,382 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-22 16:40:49,383 INFO L387 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-22 16:40:49,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:49,518 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:40:49,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-22 16:40:49,580 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:40:49,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-22 16:40:49,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:49,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-22 16:40:49,770 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-22 16:40:49,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:49,997 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:49,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-22 16:40:50,004 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:50,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-22 16:40:50,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-22 16:40:50,765 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-22 16:40:50,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630601714] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:50,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:50,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-22 16:40:50,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748673800] [2021-12-22 16:40:50,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:50,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-22 16:40:50,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:50,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-22 16:40:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=734, Unknown=8, NotChecked=0, Total=870 [2021-12-22 16:40:50,767 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:51,085 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2021-12-22 16:40:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 16:40:51,086 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 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-22 16:40:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:51,086 INFO L225 Difference]: With dead ends: 149 [2021-12-22 16:40:51,086 INFO L226 Difference]: Without dead ends: 149 [2021-12-22 16:40:51,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=966, Unknown=8, NotChecked=0, Total=1190 [2021-12-22 16:40:51,087 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 130 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:51,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 637 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 538 Invalid, 0 Unknown, 480 Unchecked, 0.2s Time] [2021-12-22 16:40:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-22 16:40:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2021-12-22 16:40:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-12-22 16:40:51,100 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 30 [2021-12-22 16:40:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:51,100 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-12-22 16:40:51,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-12-22 16:40:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:40:51,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:51,100 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] [2021-12-22 16:40:51,121 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-22 16:40:51,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-22 16:40:51,307 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230201, now seen corresponding path program 1 times [2021-12-22 16:40:51,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:51,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325750404] [2021-12-22 16:40:51,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:51,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:51,459 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-22 16:40:51,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325750404] [2021-12-22 16:40:51,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325750404] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098586459] [2021-12-22 16:40:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:51,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:51,465 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-22 16:40:51,466 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-22 16:40:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:51,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-22 16:40:51,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:51,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:40:51,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:40:51,617 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:40:51,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 16:40:51,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:51,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:51,757 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:40:51,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-22 16:40:51,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-22 16:40:51,776 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:40:51,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-22 16:40:51,830 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:40:51,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-22 16:40:51,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-22 16:40:51,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:51,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:51,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:51,966 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:51,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-22 16:40:52,005 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-22 16:40:52,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:52,556 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:52,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2021-12-22 16:40:52,560 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:52,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2021-12-22 16:40:52,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:52,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2021-12-22 16:40:52,575 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:52,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 120 [2021-12-22 16:40:52,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2021-12-22 16:40:52,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-22 16:40:52,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2021-12-22 16:40:52,948 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-22 16:40:52,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098586459] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:52,948 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:52,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-12-22 16:40:52,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122412946] [2021-12-22 16:40:52,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:52,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-22 16:40:52,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:52,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-22 16:40:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=888, Unknown=8, NotChecked=0, Total=992 [2021-12-22 16:40:52,950 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 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-22 16:40:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:54,024 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2021-12-22 16:40:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-22 16:40:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 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 30 [2021-12-22 16:40:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:54,025 INFO L225 Difference]: With dead ends: 203 [2021-12-22 16:40:54,025 INFO L226 Difference]: Without dead ends: 203 [2021-12-22 16:40:54,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=347, Invalid=1997, Unknown=8, NotChecked=0, Total=2352 [2021-12-22 16:40:54,026 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 567 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:54,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 657 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 931 Invalid, 0 Unknown, 400 Unchecked, 0.4s Time] [2021-12-22 16:40:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-22 16:40:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 140. [2021-12-22 16:40:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 139 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2021-12-22 16:40:54,029 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 30 [2021-12-22 16:40:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:54,029 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2021-12-22 16:40:54,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 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-22 16:40:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2021-12-22 16:40:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:40:54,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:54,029 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] [2021-12-22 16:40:54,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:54,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:54,239 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -862773577, now seen corresponding path program 1 times [2021-12-22 16:40:54,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:54,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966182747] [2021-12-22 16:40:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:54,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:54,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:54,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966182747] [2021-12-22 16:40:54,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966182747] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:54,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338958656] [2021-12-22 16:40:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:54,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:54,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:54,526 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-22 16:40:54,539 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-22 16:40:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:54,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-22 16:40:54,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:54,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:40:54,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 16:40:54,693 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:40:54,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 16:40:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:40:54,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:40:54,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:54,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 16:40:54,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:54,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:54,873 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:40:54,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-12-22 16:40:54,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:54,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:54,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 16:40:54,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:54,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:55,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:55,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:55,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-22 16:40:55,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:55,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:55,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:55,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_11|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))) is different from false [2021-12-22 16:40:55,228 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:40:55,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-22 16:40:55,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_682)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))))) is different from false [2021-12-22 16:40:55,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_17| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_11|) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81| v_ArrVal_682)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_81| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2021-12-22 16:40:55,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:55,370 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:55,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-22 16:40:55,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:55,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-22 16:40:55,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-22 16:40:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:55,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338958656] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:55,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:55,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 40 [2021-12-22 16:40:55,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219622567] [2021-12-22 16:40:55,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:55,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-22 16:40:55,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:55,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-22 16:40:55,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=895, Unknown=17, NotChecked=476, Total=1560 [2021-12-22 16:40:55,399 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:56,111 INFO L93 Difference]: Finished difference Result 368 states and 400 transitions. [2021-12-22 16:40:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 16:40:56,112 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 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-22 16:40:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:56,113 INFO L225 Difference]: With dead ends: 368 [2021-12-22 16:40:56,113 INFO L226 Difference]: Without dead ends: 368 [2021-12-22 16:40:56,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=397, Invalid=1870, Unknown=17, NotChecked=686, Total=2970 [2021-12-22 16:40:56,115 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 473 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1428 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:56,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 788 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 887 Invalid, 0 Unknown, 1428 Unchecked, 0.4s Time] [2021-12-22 16:40:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-12-22 16:40:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 155. [2021-12-22 16:40:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.263157894736842) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2021-12-22 16:40:56,121 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 30 [2021-12-22 16:40:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:56,121 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2021-12-22 16:40:56,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2021-12-22 16:40:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 16:40:56,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:56,123 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:40:56,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:56,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:56,335 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash 20301398, now seen corresponding path program 2 times [2021-12-22 16:40:56,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:56,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160502845] [2021-12-22 16:40:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:56,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:56,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:56,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160502845] [2021-12-22 16:40:56,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160502845] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:56,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029959675] [2021-12-22 16:40:56,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:40:56,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:56,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:56,624 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:40:56,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 16:40:56,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:40:56,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:40:56,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-22 16:40:56,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:56,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:40:56,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 16:40:56,770 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:40:56,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 16:40:56,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:56,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:40:56,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-22 16:40:56,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 16:40:56,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:56,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:56,898 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:40:56,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-12-22 16:40:56,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:56,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:56,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 16:40:56,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:56,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:40:57,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:57,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:57,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:57,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:57,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-22 16:40:57,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 16:40:57,193 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:40:57,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-22 16:40:57,200 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_804 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_804)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_811) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_20|))) is different from false [2021-12-22 16:40:57,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_22| Int) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_804 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| Int)) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86| v_ArrVal_804)) |v_ULTIMATE.start_main_#t~malloc3#1.base_22| v_ArrVal_811) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_22|) 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_20|) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2021-12-22 16:40:57,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:57,313 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:57,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-22 16:40:57,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:57,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-22 16:40:57,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-22 16:40:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-22 16:40:57,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029959675] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:57,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:57,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 34 [2021-12-22 16:40:57,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548829992] [2021-12-22 16:40:57,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:57,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-22 16:40:57,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:57,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-22 16:40:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=610, Unknown=16, NotChecked=342, Total=1122 [2021-12-22 16:40:57,337 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:40:57,903 INFO L93 Difference]: Finished difference Result 394 states and 428 transitions. [2021-12-22 16:40:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-22 16:40:57,904 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-22 16:40:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:40:57,906 INFO L225 Difference]: With dead ends: 394 [2021-12-22 16:40:57,906 INFO L226 Difference]: Without dead ends: 394 [2021-12-22 16:40:57,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=1506, Unknown=16, NotChecked=534, Total=2450 [2021-12-22 16:40:57,907 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 360 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1937 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:40:57,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 678 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 598 Invalid, 0 Unknown, 1937 Unchecked, 0.3s Time] [2021-12-22 16:40:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-12-22 16:40:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 163. [2021-12-22 16:40:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 162 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-12-22 16:40:57,911 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 33 [2021-12-22 16:40:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:40:57,911 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-12-22 16:40:57,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:40:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-12-22 16:40:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 16:40:57,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:40:57,912 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] [2021-12-22 16:40:57,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-22 16:40:58,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-22 16:40:58,129 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:40:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:40:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1167746943, now seen corresponding path program 1 times [2021-12-22 16:40:58,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:40:58,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602000781] [2021-12-22 16:40:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:58,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:40:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:58,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:40:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602000781] [2021-12-22 16:40:58,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602000781] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:40:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070589527] [2021-12-22 16:40:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:40:58,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:40:58,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:40:58,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:40:58,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 16:40:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:40:58,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-22 16:40:58,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:40:58,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:40:58,545 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:40:58,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 16:40:58,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:58,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:40:58,638 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:40:58,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-22 16:40:58,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:40:58,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-22 16:40:58,683 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:40:58,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2021-12-22 16:40:58,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-22 16:40:58,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-22 16:40:58,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:58,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:40:58,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:58,819 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:58,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2021-12-22 16:40:58,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:40:58,857 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:58,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-22 16:40:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:58,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:40:59,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 62 [2021-12-22 16:40:59,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (and (forall ((v_ArrVal_893 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) |c_ULTIMATE.start_main_~end~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4) (+ .cse0 4))) (not (<= 0 .cse0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_90| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_90|))))) is different from false [2021-12-22 16:40:59,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (not (<= 0 .cse0)) (let ((.cse1 (< |c_ULTIMATE.start_main_#t~mem4#1.offset| 0))) (and (or .cse1 (forall ((v_ArrVal_893 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|)))) (<= |c_ULTIMATE.start_main_#t~mem4#1.offset| .cse0) (or .cse1 (<= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_90| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_90|))))) is different from false [2021-12-22 16:40:59,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse1 (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_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (< .cse0 0))) (and (<= .cse0 .cse1) (or .cse2 (<= .cse1 0)) (or (forall ((v_ArrVal_893 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) .cse3))) .cse2)))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_90| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 .cse1)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_90|))))) is different from false [2021-12-22 16:40:59,587 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:59,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2021-12-22 16:40:59,591 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:59,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2021-12-22 16:40:59,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:59,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 98 [2021-12-22 16:40:59,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2021-12-22 16:40:59,609 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:40:59,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 106 [2021-12-22 16:40:59,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2021-12-22 16:40:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:40:59,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070589527] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:40:59,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:40:59,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 38 [2021-12-22 16:40:59,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841530397] [2021-12-22 16:40:59,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:40:59,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-22 16:40:59,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:40:59,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-22 16:40:59,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1082, Unknown=4, NotChecked=204, Total=1406 [2021-12-22 16:40:59,960 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 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-22 16:41:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:41:00,831 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2021-12-22 16:41:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 16:41:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 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 35 [2021-12-22 16:41:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:41:00,836 INFO L225 Difference]: With dead ends: 170 [2021-12-22 16:41:00,836 INFO L226 Difference]: Without dead ends: 170 [2021-12-22 16:41:00,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=278, Invalid=1800, Unknown=4, NotChecked=270, Total=2352 [2021-12-22 16:41:00,838 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 108 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:41:00,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 910 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 795 Invalid, 0 Unknown, 487 Unchecked, 0.4s Time] [2021-12-22 16:41:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-22 16:41:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2021-12-22 16:41:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.25) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:41:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2021-12-22 16:41:00,840 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 35 [2021-12-22 16:41:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:41:00,840 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2021-12-22 16:41:00,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 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-22 16:41:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2021-12-22 16:41:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 16:41:00,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:41:00,841 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:41:00,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-22 16:41:01,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:41:01,058 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 16:41:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:41:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1209765196, now seen corresponding path program 2 times [2021-12-22 16:41:01,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:41:01,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134352898] [2021-12-22 16:41:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:41:01,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:41:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:41:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:41:01,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:41:01,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134352898] [2021-12-22 16:41:01,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134352898] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:41:01,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400443832] [2021-12-22 16:41:01,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:41:01,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:41:01,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:41:01,237 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:41:01,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 16:41:01,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:41:01,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:41:01,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-22 16:41:01,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:41:01,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:41:01,409 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:41:01,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 16:41:01,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:41:01,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:41:01,530 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-22 16:41:01,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2021-12-22 16:41:01,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:41:01,540 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-22 16:41:01,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-22 16:41:01,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:41:01,600 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-22 16:41:01,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2021-12-22 16:41:01,608 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-22 16:41:01,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2021-12-22 16:41:01,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:41:01,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:41:01,995 INFO L353 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-12-22 16:41:01,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 38 [2021-12-22 16:41:01,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:41:02,000 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:41:02,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-22 16:41:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:41:02,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:41:08,669 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:41:08,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 16172 treesize of output 14945 [2021-12-22 16:41:09,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:41:09,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:41:10,544 INFO L353 Elim1Store]: treesize reduction 624, result has 48.3 percent of original size [2021-12-22 16:41:10,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 2000873 treesize of output 1916530