./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/tree-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:42:49,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:42:49,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:42:49,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:42:49,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:42:49,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:42:49,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:42:49,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:42:49,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:42:49,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:42:49,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:42:49,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:42:49,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:42:49,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:42:49,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:42:49,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:42:49,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:42:49,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:42:49,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:42:49,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:42:49,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:42:49,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:42:49,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:42:49,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:42:49,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:42:49,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:42:49,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:42:49,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:42:49,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:42:49,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:42:49,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:42:49,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:42:49,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:42:49,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:42:49,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:42:49,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:42:49,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:42:49,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:42:49,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:42:49,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:42:49,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:42:49,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-16 05:42:49,132 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:42:49,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:42:49,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:42:49,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:42:49,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:42:49,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:42:49,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:42:49,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:42:49,134 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:42:49,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:42:49,135 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:42:49,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:42:49,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:42:49,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:42:49,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:42:49,135 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:42:49,136 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:42:49,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:42:49,136 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:42:49,136 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:42:49,136 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:42:49,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:42:49,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:42:49,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:42:49,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:42:49,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:42:49,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:42:49,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:42:49,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:42:49,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:42:49,138 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-memcleanup) ) 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 -> 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e [2021-12-16 05:42:49,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:42:49,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:42:49,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:42:49,339 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:42:49,339 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:42:49,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-4.i [2021-12-16 05:42:49,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392e732e/48c19dcdc54441bd9b65a20c85aa28a6/FLAG2ddd3319d [2021-12-16 05:42:49,753 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:42:49,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i [2021-12-16 05:42:49,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392e732e/48c19dcdc54441bd9b65a20c85aa28a6/FLAG2ddd3319d [2021-12-16 05:42:50,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392e732e/48c19dcdc54441bd9b65a20c85aa28a6 [2021-12-16 05:42:50,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:42:50,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:42:50,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:42:50,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:42:50,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:42:50,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6d8e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50, skipping insertion in model container [2021-12-16 05:42:50,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:42:50,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:42:50,415 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/heap-manipulation/tree-4.i[22626,22639] [2021-12-16 05:42:50,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:42:50,448 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:42:50,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2021-12-16 05:42:50,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:42:50,494 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:42:50,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50 WrapperNode [2021-12-16 05:42:50,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:42:50,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:42:50,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:42:50,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:42:50,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,556 INFO L137 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2021-12-16 05:42:50,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:42:50,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:42:50,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:42:50,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:42:50,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:42:50,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:42:50,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:42:50,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:42:50,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (1/1) ... [2021-12-16 05:42:50,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:42:50,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:42:50,632 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-16 05:42:50,640 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-16 05:42:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:42:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-16 05:42:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-16 05:42:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:42:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:42:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:42:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:42:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:42:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:42:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:42:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:42:50,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:42:50,754 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:42:50,758 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:42:51,111 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:42:51,116 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:42:51,117 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-16 05:42:51,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:42:51 BoogieIcfgContainer [2021-12-16 05:42:51,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:42:51,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:42:51,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:42:51,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:42:51,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:42:50" (1/3) ... [2021-12-16 05:42:51,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b16f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:42:51, skipping insertion in model container [2021-12-16 05:42:51,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:42:50" (2/3) ... [2021-12-16 05:42:51,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b16f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:42:51, skipping insertion in model container [2021-12-16 05:42:51,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:42:51" (3/3) ... [2021-12-16 05:42:51,142 INFO L111 eAbstractionObserver]: Analyzing ICFG tree-4.i [2021-12-16 05:42:51,146 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:42:51,146 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-16 05:42:51,187 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:42:51,194 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-16 05:42:51,194 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-16 05:42:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 79 states have (on average 2.1772151898734178) internal successors, (172), 147 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 05:42:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:42:51,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:51,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:42:51,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash 31591498, now seen corresponding path program 1 times [2021-12-16 05:42:51,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:51,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288535580] [2021-12-16 05:42:51,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:51,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:51,331 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-16 05:42:51,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:51,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288535580] [2021-12-16 05:42:51,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288535580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:51,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:51,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:42:51,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524995696] [2021-12-16 05:42:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:51,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 05:42:51,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 05:42:51,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:42:51,367 INFO L87 Difference]: Start difference. First operand has 149 states, 79 states have (on average 2.1772151898734178) internal successors, (172), 147 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:51,395 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-12-16 05:42:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 05:42:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-16 05:42:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:51,405 INFO L225 Difference]: With dead ends: 147 [2021-12-16 05:42:51,405 INFO L226 Difference]: Without dead ends: 145 [2021-12-16 05:42:51,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:42:51,410 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:51,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:42:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-16 05:42:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-12-16 05:42:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 77 states have (on average 2.0) internal successors, (154), 143 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2021-12-16 05:42:51,457 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 5 [2021-12-16 05:42:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:51,458 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2021-12-16 05:42:51,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2021-12-16 05:42:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:42:51,459 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:51,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:42:51,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:42:51,460 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:51,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 978320648, now seen corresponding path program 1 times [2021-12-16 05:42:51,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:51,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144670590] [2021-12-16 05:42:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:51,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:51,518 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-16 05:42:51,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:51,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144670590] [2021-12-16 05:42:51,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144670590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:51,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:51,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:42:51,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872019330] [2021-12-16 05:42:51,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:51,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:42:51,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:51,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:42:51,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:51,522 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:51,593 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2021-12-16 05:42:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:42:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-16 05:42:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:51,597 INFO L225 Difference]: With dead ends: 149 [2021-12-16 05:42:51,597 INFO L226 Difference]: Without dead ends: 149 [2021-12-16 05:42:51,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:51,600 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 89 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:51,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-16 05:42:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-12-16 05:42:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.962962962962963) internal successors, (159), 147 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2021-12-16 05:42:51,612 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 6 [2021-12-16 05:42:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:51,614 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2021-12-16 05:42:51,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2021-12-16 05:42:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:42:51,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:51,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:42:51,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:42:51,619 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash 978321707, now seen corresponding path program 1 times [2021-12-16 05:42:51,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:51,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18538602] [2021-12-16 05:42:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:51,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:51,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:51,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18538602] [2021-12-16 05:42:51,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18538602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:51,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:51,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:42:51,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012647156] [2021-12-16 05:42:51,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:51,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:42:51,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:42:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:51,680 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:51,809 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2021-12-16 05:42:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:42:51,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-16 05:42:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:51,810 INFO L225 Difference]: With dead ends: 224 [2021-12-16 05:42:51,811 INFO L226 Difference]: Without dead ends: 224 [2021-12-16 05:42:51,811 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-16 05:42:51,817 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 133 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:51,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 235 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-16 05:42:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 142. [2021-12-16 05:42:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 83 states have (on average 1.855421686746988) internal successors, (154), 140 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2021-12-16 05:42:51,830 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 6 [2021-12-16 05:42:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:51,830 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2021-12-16 05:42:51,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2021-12-16 05:42:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:42:51,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:51,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:42:51,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:42:51,832 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 978321708, now seen corresponding path program 1 times [2021-12-16 05:42:51,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:51,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861805086] [2021-12-16 05:42:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:51,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:51,868 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-16 05:42:51,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861805086] [2021-12-16 05:42:51,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861805086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:51,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:51,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:42:51,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167108248] [2021-12-16 05:42:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:51,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:42:51,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:51,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:42:51,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:51,871 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:51,990 INFO L93 Difference]: Finished difference Result 244 states and 267 transitions. [2021-12-16 05:42:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:42:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-16 05:42:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:51,991 INFO L225 Difference]: With dead ends: 244 [2021-12-16 05:42:51,991 INFO L226 Difference]: Without dead ends: 244 [2021-12-16 05:42:51,992 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-16 05:42:51,997 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 127 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:51,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 265 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-16 05:42:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 153. [2021-12-16 05:42:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7551020408163265) internal successors, (172), 151 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2021-12-16 05:42:52,011 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 6 [2021-12-16 05:42:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:52,011 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2021-12-16 05:42:52,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2021-12-16 05:42:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-16 05:42:52,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:52,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:52,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:42:52,013 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash -466102223, now seen corresponding path program 1 times [2021-12-16 05:42:52,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:52,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068288412] [2021-12-16 05:42:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:52,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:52,061 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-16 05:42:52,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:52,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068288412] [2021-12-16 05:42:52,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068288412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:52,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:52,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:42:52,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277271646] [2021-12-16 05:42:52,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:52,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:42:52,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:42:52,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:52,063 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:52,075 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2021-12-16 05:42:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:42:52,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-16 05:42:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:52,076 INFO L225 Difference]: With dead ends: 242 [2021-12-16 05:42:52,077 INFO L226 Difference]: Without dead ends: 242 [2021-12-16 05:42:52,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:52,077 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 93 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:52,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:42:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-16 05:42:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 157. [2021-12-16 05:42:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.7254901960784315) internal successors, (176), 155 states have internal predecessors, (176), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2021-12-16 05:42:52,081 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 9 [2021-12-16 05:42:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:52,081 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2021-12-16 05:42:52,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2021-12-16 05:42:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-16 05:42:52,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:52,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:52,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:42:52,083 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1908517563, now seen corresponding path program 1 times [2021-12-16 05:42:52,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:52,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129826535] [2021-12-16 05:42:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:52,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:52,117 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-16 05:42:52,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129826535] [2021-12-16 05:42:52,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129826535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:52,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:52,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:42:52,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004565884] [2021-12-16 05:42:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:52,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:42:52,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:42:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:52,120 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:52,196 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2021-12-16 05:42:52,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:42:52,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-16 05:42:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:52,198 INFO L225 Difference]: With dead ends: 237 [2021-12-16 05:42:52,198 INFO L226 Difference]: Without dead ends: 236 [2021-12-16 05:42:52,198 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-16 05:42:52,200 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 79 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:52,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 198 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-16 05:42:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 161. [2021-12-16 05:42:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 159 states have internal predecessors, (180), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2021-12-16 05:42:52,203 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 10 [2021-12-16 05:42:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:52,203 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2021-12-16 05:42:52,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2021-12-16 05:42:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 05:42:52,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:52,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:52,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:42:52,205 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 134253526, now seen corresponding path program 1 times [2021-12-16 05:42:52,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:52,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193043689] [2021-12-16 05:42:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:52,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:52,281 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-16 05:42:52,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:52,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193043689] [2021-12-16 05:42:52,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193043689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:52,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:52,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:42:52,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385939152] [2021-12-16 05:42:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:52,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:42:52,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:42:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:42:52,283 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:52,324 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2021-12-16 05:42:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:42:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-16 05:42:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:52,326 INFO L225 Difference]: With dead ends: 166 [2021-12-16 05:42:52,326 INFO L226 Difference]: Without dead ends: 161 [2021-12-16 05:42:52,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:42:52,327 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 11 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:52,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 550 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:42:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-16 05:42:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2021-12-16 05:42:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 154 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2021-12-16 05:42:52,330 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 12 [2021-12-16 05:42:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:52,331 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2021-12-16 05:42:52,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2021-12-16 05:42:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:42:52,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:52,332 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:52,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:42:52,332 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 570713568, now seen corresponding path program 1 times [2021-12-16 05:42:52,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288146547] [2021-12-16 05:42:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:52,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:52,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:52,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288146547] [2021-12-16 05:42:52,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288146547] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:42:52,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349469842] [2021-12-16 05:42:52,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:52,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:42:52,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:42:52,418 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-16 05:42:52,423 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-16 05:42:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:52,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 05:42:52,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:42:52,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:42:52,619 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:42:52,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-16 05:42:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:52,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:42:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:52,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349469842] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:42:52,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:42:52,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-16 05:42:52,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701510135] [2021-12-16 05:42:52,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:42:52,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:42:52,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:52,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:42:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:42:52,802 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-16 05:42:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:52,921 INFO L93 Difference]: Finished difference Result 278 states and 310 transitions. [2021-12-16 05:42:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:42:52,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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 18 [2021-12-16 05:42:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:52,923 INFO L225 Difference]: With dead ends: 278 [2021-12-16 05:42:52,923 INFO L226 Difference]: Without dead ends: 278 [2021-12-16 05:42:52,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:42:52,924 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 403 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:52,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 261 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2021-12-16 05:42:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-16 05:42:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 155. [2021-12-16 05:42:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 153 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2021-12-16 05:42:52,928 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 18 [2021-12-16 05:42:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:52,928 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2021-12-16 05:42:52,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-16 05:42:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2021-12-16 05:42:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:42:52,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:52,929 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:52,949 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-16 05:42:53,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:42:53,147 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash 570713569, now seen corresponding path program 1 times [2021-12-16 05:42:53,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:53,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699024114] [2021-12-16 05:42:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:53,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:53,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699024114] [2021-12-16 05:42:53,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699024114] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:42:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662733031] [2021-12-16 05:42:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:53,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:42:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:42:53,210 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-16 05:42:53,212 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-16 05:42:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:53,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 05:42:53,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:42:53,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:42:53,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:42:53,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:42:53,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-16 05:42:53,397 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:42:53,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 05:42:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:53,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:42:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:53,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662733031] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:42:53,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:42:53,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-16 05:42:53,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500379251] [2021-12-16 05:42:53,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:42:53,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:42:53,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:42:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:42:53,710 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:53,955 INFO L93 Difference]: Finished difference Result 327 states and 353 transitions. [2021-12-16 05:42:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:42:53,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 05:42:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:53,957 INFO L225 Difference]: With dead ends: 327 [2021-12-16 05:42:53,957 INFO L226 Difference]: Without dead ends: 327 [2021-12-16 05:42:53,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:42:53,958 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 722 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:53,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 303 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 308 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2021-12-16 05:42:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-12-16 05:42:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 154. [2021-12-16 05:42:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.702970297029703) internal successors, (172), 152 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2021-12-16 05:42:53,962 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 18 [2021-12-16 05:42:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:53,963 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2021-12-16 05:42:53,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2021-12-16 05:42:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 05:42:53,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:53,964 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:53,991 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-16 05:42:54,173 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,SelfDestructingSolverStorable8 [2021-12-16 05:42:54,173 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash -309931284, now seen corresponding path program 1 times [2021-12-16 05:42:54,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:54,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43132958] [2021-12-16 05:42:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:54,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:54,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:54,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43132958] [2021-12-16 05:42:54,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43132958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:54,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:54,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:42:54,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900111020] [2021-12-16 05:42:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:54,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:42:54,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:42:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:54,210 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:54,246 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2021-12-16 05:42:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:42:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-16 05:42:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:54,250 INFO L225 Difference]: With dead ends: 162 [2021-12-16 05:42:54,250 INFO L226 Difference]: Without dead ends: 162 [2021-12-16 05:42:54,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:42:54,251 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:54,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:42:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-16 05:42:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2021-12-16 05:42:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 100 states have (on average 1.69) internal successors, (169), 151 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2021-12-16 05:42:54,255 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 19 [2021-12-16 05:42:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:54,265 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2021-12-16 05:42:54,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2021-12-16 05:42:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 05:42:54,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:54,269 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:54,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:42:54,269 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash 145073858, now seen corresponding path program 1 times [2021-12-16 05:42:54,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:54,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838114289] [2021-12-16 05:42:54,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:54,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:42:54,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838114289] [2021-12-16 05:42:54,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838114289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:54,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:54,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:42:54,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126387423] [2021-12-16 05:42:54,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:54,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:42:54,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:54,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:42:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:42:54,326 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 5 states, 4 states have (on average 5.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-16 05:42:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:54,418 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2021-12-16 05:42:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:42:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.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 21 [2021-12-16 05:42:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:54,420 INFO L225 Difference]: With dead ends: 152 [2021-12-16 05:42:54,420 INFO L226 Difference]: Without dead ends: 152 [2021-12-16 05:42:54,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:42:54,420 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 7 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:54,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-16 05:42:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-16 05:42:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.67) internal successors, (167), 150 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2021-12-16 05:42:54,423 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 21 [2021-12-16 05:42:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:54,424 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2021-12-16 05:42:54,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.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-16 05:42:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2021-12-16 05:42:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 05:42:54,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:54,425 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:54,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:42:54,425 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 145073859, now seen corresponding path program 1 times [2021-12-16 05:42:54,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:54,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547147658] [2021-12-16 05:42:54,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:54,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:42:54,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:54,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547147658] [2021-12-16 05:42:54,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547147658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:54,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:54,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:42:54,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042148757] [2021-12-16 05:42:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:54,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:42:54,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:42:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:42:54,482 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand has 5 states, 4 states have (on average 5.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-16 05:42:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:54,578 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2021-12-16 05:42:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:42:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.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 21 [2021-12-16 05:42:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:54,580 INFO L225 Difference]: With dead ends: 151 [2021-12-16 05:42:54,580 INFO L226 Difference]: Without dead ends: 151 [2021-12-16 05:42:54,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:42:54,581 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:54,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 381 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-16 05:42:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-16 05:42:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.65) internal successors, (165), 149 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2021-12-16 05:42:54,584 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 21 [2021-12-16 05:42:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:54,586 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2021-12-16 05:42:54,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.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-16 05:42:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2021-12-16 05:42:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:42:54,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:54,589 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] [2021-12-16 05:42:54,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:42:54,589 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1158251601, now seen corresponding path program 1 times [2021-12-16 05:42:54,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:54,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379339034] [2021-12-16 05:42:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:54,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:54,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:54,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379339034] [2021-12-16 05:42:54,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379339034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:54,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:54,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:42:54,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115066909] [2021-12-16 05:42:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:54,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:42:54,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:42:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:42:54,662 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:54,826 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2021-12-16 05:42:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:42:54,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-16 05:42:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:54,827 INFO L225 Difference]: With dead ends: 152 [2021-12-16 05:42:54,827 INFO L226 Difference]: Without dead ends: 152 [2021-12-16 05:42:54,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:42:54,828 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 47 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:54,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 394 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-16 05:42:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2021-12-16 05:42:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.64) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2021-12-16 05:42:54,830 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 24 [2021-12-16 05:42:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:54,830 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2021-12-16 05:42:54,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2021-12-16 05:42:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:42:54,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:54,831 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] [2021-12-16 05:42:54,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:42:54,831 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1158251602, now seen corresponding path program 1 times [2021-12-16 05:42:54,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:54,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860253682] [2021-12-16 05:42:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:54,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:54,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:54,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860253682] [2021-12-16 05:42:54,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860253682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:54,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:54,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:42:54,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779806249] [2021-12-16 05:42:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:54,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:42:54,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:42:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:42:54,915 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:55,110 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2021-12-16 05:42:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:42:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-16 05:42:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:55,111 INFO L225 Difference]: With dead ends: 151 [2021-12-16 05:42:55,111 INFO L226 Difference]: Without dead ends: 151 [2021-12-16 05:42:55,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:42:55,112 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 44 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:55,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 409 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:42:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-16 05:42:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-16 05:42:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.63) internal successors, (163), 149 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2021-12-16 05:42:55,114 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 24 [2021-12-16 05:42:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:55,114 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2021-12-16 05:42:55,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2021-12-16 05:42:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:42:55,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:55,115 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:55,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:42:55,115 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:55,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash -293756023, now seen corresponding path program 1 times [2021-12-16 05:42:55,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:55,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417360077] [2021-12-16 05:42:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:55,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:55,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:55,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417360077] [2021-12-16 05:42:55,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417360077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:55,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:55,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:42:55,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088861914] [2021-12-16 05:42:55,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:55,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:42:55,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:55,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:42:55,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:42:55,199 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:55,407 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2021-12-16 05:42:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:42:55,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-16 05:42:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:55,408 INFO L225 Difference]: With dead ends: 152 [2021-12-16 05:42:55,408 INFO L226 Difference]: Without dead ends: 152 [2021-12-16 05:42:55,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-12-16 05:42:55,409 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:55,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 540 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:42:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-16 05:42:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2021-12-16 05:42:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.62) internal successors, (162), 149 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2021-12-16 05:42:55,411 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 27 [2021-12-16 05:42:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:55,412 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2021-12-16 05:42:55,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2021-12-16 05:42:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:42:55,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:55,412 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:55,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:42:55,412 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -293756022, now seen corresponding path program 1 times [2021-12-16 05:42:55,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:55,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139439180] [2021-12-16 05:42:55,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:55,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:55,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:55,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139439180] [2021-12-16 05:42:55,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139439180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:55,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:55,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:42:55,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632874031] [2021-12-16 05:42:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:55,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:42:55,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:42:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:42:55,521 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:55,751 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2021-12-16 05:42:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:42:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-16 05:42:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:55,752 INFO L225 Difference]: With dead ends: 151 [2021-12-16 05:42:55,752 INFO L226 Difference]: Without dead ends: 151 [2021-12-16 05:42:55,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-12-16 05:42:55,752 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:55,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 487 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:42:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-16 05:42:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-16 05:42:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.61) internal successors, (161), 149 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2021-12-16 05:42:55,755 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 27 [2021-12-16 05:42:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:55,755 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2021-12-16 05:42:55,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2021-12-16 05:42:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 05:42:55,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:55,755 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-16 05:42:55,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:42:55,755 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1857729656, now seen corresponding path program 1 times [2021-12-16 05:42:55,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:55,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603631892] [2021-12-16 05:42:55,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:55,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:55,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:55,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603631892] [2021-12-16 05:42:55,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603631892] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:55,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:55,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:42:55,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247787425] [2021-12-16 05:42:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:55,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:42:55,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:42:55,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:42:55,876 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:56,138 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2021-12-16 05:42:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:42:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-16 05:42:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:56,140 INFO L225 Difference]: With dead ends: 153 [2021-12-16 05:42:56,140 INFO L226 Difference]: Without dead ends: 153 [2021-12-16 05:42:56,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-12-16 05:42:56,141 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:56,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 544 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:42:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-16 05:42:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2021-12-16 05:42:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.6) internal successors, (160), 149 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2021-12-16 05:42:56,144 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2021-12-16 05:42:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:56,145 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2021-12-16 05:42:56,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2021-12-16 05:42:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 05:42:56,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:56,145 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-16 05:42:56,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:42:56,146 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1857729657, now seen corresponding path program 1 times [2021-12-16 05:42:56,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:56,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587772423] [2021-12-16 05:42:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:56,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:56,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587772423] [2021-12-16 05:42:56,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587772423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:42:56,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:42:56,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:42:56,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187948510] [2021-12-16 05:42:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:42:56,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:42:56,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:42:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:42:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:42:56,289 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:42:56,585 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-12-16 05:42:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:42:56,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-16 05:42:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:42:56,586 INFO L225 Difference]: With dead ends: 151 [2021-12-16 05:42:56,586 INFO L226 Difference]: Without dead ends: 151 [2021-12-16 05:42:56,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:42:56,587 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 50 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:42:56,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 569 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:42:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-16 05:42:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-16 05:42:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.59) internal successors, (159), 149 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2021-12-16 05:42:56,590 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 30 [2021-12-16 05:42:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:42:56,590 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2021-12-16 05:42:56,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:42:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2021-12-16 05:42:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:42:56,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:42:56,591 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:42:56,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 05:42:56,591 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-16 05:42:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:42:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1366780878, now seen corresponding path program 1 times [2021-12-16 05:42:56,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:42:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164081005] [2021-12-16 05:42:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:56,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:42:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:56,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:42:56,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164081005] [2021-12-16 05:42:56,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164081005] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:42:56,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630445184] [2021-12-16 05:42:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:42:56,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:42:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:42:56,800 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-16 05:42:56,801 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-16 05:42:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:42:56,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-16 05:42:56,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:42:56,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:42:56,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 05:42:56,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 05:42:56,983 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-16 05:42:56,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 05:42:56,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:42:56,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 05:42:57,021 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-16 05:42:57,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 05:42:57,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:42:57,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-16 05:42:57,060 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:42:57,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 05:42:57,116 INFO L354 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2021-12-16 05:42:57,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 05:42:57,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:42:57,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:42:57,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:42:57,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 05:42:57,233 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:42:57,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-16 05:42:57,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-16 05:42:57,312 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:42:57,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-16 05:42:57,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-16 05:42:57,373 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:42:57,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-16 05:42:57,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-16 05:42:57,459 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:42:57,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-16 05:42:57,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-16 05:42:57,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:42:57,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-12-16 05:42:57,494 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-16 05:42:57,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 14 [2021-12-16 05:42:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:42:57,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:42:57,552 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_668) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_667) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:57,559 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:57,572 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_665 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_666))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:57,582 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_665 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:57,600 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_663))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_663))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_664) .cse2 v_ArrVal_665) (select (select (store .cse3 .cse2 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:57,613 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) (select (select (store .cse2 .cse1 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668)))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:57,635 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_661))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_662) .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) (select (select (store .cse2 .cse1 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_661))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:57,651 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_661))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_661))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_663))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_662) .cse4 v_ArrVal_664) .cse5 v_ArrVal_665) (select (select (store .cse6 .cse5 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668)))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-16 05:42:59,112 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-16 05:42:59,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 464 [2021-12-16 05:42:59,142 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-16 05:42:59,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 464 treesize of output 222 [2021-12-16 05:42:59,215 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-16 05:42:59,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27183822 treesize of output 23569334